Sequentially and piecewise-affinity in segments of real-PCF

Electronic Notes in Theoretical Computer Science

Volumn 73, Issue , 2004, Pages 3-43

  Farjudian, Amin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Interval domain; Logical relations; PCF; Real number computation; Real PCF; Sequentially

Indexed keywords

COMPUTATION THEORY; DIGITAL ARITHMETIC; FUNCTION EVALUATION; LOGIC PROGRAMMING; MATHEMATICAL MODELS; NUMBER THEORY; SET THEORY;

INTERVAL DOMAIN; LOGICAL RELATIONS; PROGRAMMING LANGUAGE FOR COMPUTABLE FUNCTIONS (PCF); REAL-NUMBER COMPUTATION; REAL-PCF; SEQUENTIALITY;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 18944408329     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.08.002     Document Type: Conference Paper

References (16)

1. R. Amadio and P.-L. Curien. Domains and Lambda Calculi, volume 46 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
2. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.
3. H.-J. Böhm, R. Cartwright, M. J. O'Donnell, and M. Riggle. Exact real arithmetic: A case study in higher order programming. In ACM Symposium on Lisp and Functional Programming. Association of Computing Machinery, 1986.
4. G. Berry. Modèles Complèment Adéquats et Stables des Lambda-calculs typés, 1979. Thèse de Doctorat d'Etat, Université Paris VII.
5. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers. Bulletin of the American Mathematical Society, 21:1-46, 1989.
6. M. H. Escardó, M. Hofmann, and T. Streicher. Mediation is inherently parallel, 1998. University of Edinburgh, Laboratory for Foundations of Computer Science, EPSRC report for project GR/M64840.
7. Martín Hötzel Escardó. Real pcf extended with ∃ is universal. In A. Edalat, S. Jourdan, and G. McCusker, editors, Advances in Theory and Formal Methods of Computing: Proceedings of the Third Imperial College Workshop, pages 13-24, Christ Church, Oxford, April 1996. IC Press.
8. Martín Hötzel Escardó. PCF extended with real numbers: a domain-theoretic approach to higher-order exact real number computation. PhD thesis, The University of Edinburgh, Department of Computer Science, November 1997.
9. Amin Farjudian. Conservativity of wrpcf over pcf. Presented in BCTCS 19, Leicester, England, April 7-9, 2003.
10. Pietro Di Gianantonio. A Functional Approach to Computability on Real Numbers. PhD thesis, Università di Pisa-Genova-Udine, 1993.
11. A. Jung and J. Tiuryn. A new characterization of lambda definability. Technical Report 1498, Technische Hochschule Darmstadt, 1992.
12. Valérie Ménissier-Morain. Arbitrary precision real arithmetic: design and algorithms. Submitted to the Journal of Symbolic Computation, September 1996.
13. G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
14. K. Sieber. Reasoning about sequential functions via logical relations. In M. P. Fourman, P. T. Johnstone, and A. M. Pitts, editors, Proc. LMS Symposium on Applications of Categories in Computer Science, Durham 1991, volume 177 of LMS Lecture Note Series, pages 258-269. Cambridge University Press, 1992.
15. A. Stoughton. Interdefinability of parallel operations in PCF. Theoretical Computer Science, 79:357-358, 1991.
16. J. Vuillemin. Syntaxe, sèmantique et axiomatique d'un langage de programmation simple, 1974. Thèse de Doctorat d'Etat, Université Paris VII.