Partial applicative theories and explicit substitutions

Journal of Logic and Computation

Volumn 6, Issue 1, 1996, Pages 55-77

  Strahm, Thomas ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Explicit mathematics; Explicit substitutions; Logic of partial terms; Partial combinatory logic; Partial calculus

Indexed keywords

EID: 0003321388     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/6.1.55     Document Type: Article

References (28)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1, 375-416, 1991.
2. M. J. Beeson. Foundations of Constructive Mathematics: Metamathematical Studies. Springer, Berlin, 1984.
3. M. J. Beeson. Proving programs and programming proofs. In Logic, Methodology and Philosophy of Science VII, R. Barcan Marcus, G. J. W. Dorn and P. Weingartner, eds, pp. 51-82. North Holland, Amsterdam, 1986.
4. P.-L. Curien. An abstract framework for environment machines. Theoretical Computer Science, 82, 389-402, 1991.
5. P.-L. Curien, T. Hardin and J.-J. Levy. Confluence properties of weak and strong calculi of explicit substitutions. Technical Report 92-01, CEDRIC, 292 rue Saint-Martin, 75141 Paris Cedex 03, France, 1992. Submitted to J.A.C.M.
6. S. Feferman. A language and axioms for explicit mathematics. In Algebra and Logic, Vol. 450 of Lecture Notes in Mathematics, J. N. Crossley, ed., pp. 87-139. Springer, Berlin, 1975.
7. S. Feferman. Constructive theories of functions and classes. In Logic Colloquium '78, M. Boffa, D. van Dalen and K. McAloon, eds, pp. 159-224. North Holland, Amsterdam, 1979.
8. S. Feferman. Polymorphic typed lambda-calculi in a type-free axiomatic framework. In Logic and Computation, Vol. 106 of Contemporary Mathematics, W. Sieg, ed., pp. 101-136. American Mathematical Society, Providence, Rhode Island, 1990.
9. S. Feferman. Logics for termination and correctness of functional programs. In Logic from Computer Science, Vol. 21 of MSRI Publications, Y. N. Moschovakis, ed., pp. 95-127. Springer, Berlin, 1991.
10. S. Feferman. Logics for termination and correctness of functional programs II: Logics of strength PRA. In Proof Theory, P. Aczel, H. Simmons and S. S. Wainer, eds, pp. 195-225. Cambridge University Press, Cambridge, 1992.
11. S. Feferman and G. Jäger. Systems of explicit mathematics with non-constructive μ-operator. Part I. Annals of Pure and Applied Logic, 65, 243-263, 1993.
12. T. Hardin. Confluence results for the pure strong categorical logic CCL: λ-calculi as subsystems of CCL. Theoretical Computer Science, 65, 291-342, 1989.
13. T. Hardin and J.-J. Lévy. A confluent calculus of substitutions. Technical Report 90-11, CEDRIC, 292 rue Saint-Martin, 75141 Paris Cédex 03, France, 1990.
14. J. R. Hindley. Combinatory reductions and lambda reductions compared. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 23, 169-180, 1977.
15. J. R. Hindley and G. Longo. Lambda-calculus models and extensionality. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 26, 289-310, 1980.
16. G. Jäger. Induction in the elementary theory of types and names. In Computer Science Logic '87, Vol. 329 of Lecture Notes in Computer Science, E. Börger, H. Kleine Büning and M. M. Richter, eds, pp. 118-128. Springer, Berlin, 1988.
17. G. Jäger. Type theory and explicit mathematics. In Logic Colloquium '87, H.-D. Ebbinghaus, J. Fernandez-Prida, M. Garrido, M. Lascar and M. Rodriguez Artalejo, eds, pp. 117-135. North Holland, Amsterdam, 1989.
18. G. Jäger and Th. Strahm. Totality in applicative theories. Annals of Pure and Applied Logic. Accepted for publication.
19. S. C. Kleene. Introduction to Metamathematics. North Holland, Amsterdam, 1952.
20. P. Lescanne and J. Rouyer-Degli. The calculus of explicit substitution λv. Technical report, CNRS and INRIA-Lorraine, Campus Scientifique, BP 239, 54506 Vandœuvre-lès-Nancy, France, March 1994.
21. P. Martin-Löf. Substitition calculus. Unpublished notes, September 1992.
22. M. Marzetta. A theory of types and names. Contributed paper. Logic Colloquium, Padova 23-30 August 1988.
23. M. Marzetta. Universes in the theory of types and names. In Computer Science Logic '92, Vol. 702 of Lecture Notes in Computer Science, E. Börger, G. Jäger, H. Kleine Büning, S. Martin and M. M. Richter, eds, pp. 340-351. Springer, Berlin, 1993.
24. E. Moggi. The partial lambda calculus. PhD thesis, University of Edinburgh, 1988.
25. M. H. A. Newman. On theories with a combinatorial definition of "equivalence". Annals of Mathematics, 43, 223-243, 1942.
26. A. Tasistro. Formulation of Martin-Löf's theory of types with explicit substitutions. Technical report, Department of Computer Sciences, University of Göteborg, May 1993.
27. A. S. Troelstra and D. van Dalen. Constructivism in Mathematics, Vol. I. North Holland, Amsterdam, 1988.
28. A. S. Troelstra and D. van Dalen. Constructivism in Mathematics, Vol. II. North Holland, Amsterdam, 1988.