Explicit substitutitions for constructive necessity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 743-754

  Ghani, Neil ^a   De Paiva, Valeria ^a   Ritter, Eike ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIFFERENTIATION (CALCULUS); SYNTACTICS;

ABSTRACT MACHINES; BINDING ANALYSIS; EXPLICIT SUBSTITUTIONS; FUNCTIONAL LANGUAGES; LAMBDA CALCULUS; MODAL LOGIC; PARTIAL EVALUATION; SYNTACTIC PROPERTIES;

CALCULATIONS;

EID: 84878555324     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055098     Document Type: Conference Paper

References (18)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
2. C. Consel. Binding time analysis for higher order untyped functional languages. In Proc. ACM conference on Lisp and functional programming, pages 264-272, 1990.
3. R. Davies. A temporal logic approach to binding-time analysis. In Proc. of LWS'96, pages 184-193, 1996.
4. R. Davies and F. Pfenning. A modal analysis of staged computation. In Guy Steele, Jr., editor, Proc. of 23rd POPL, pages 258-270. ACM Press, 1996.
5. N. Ghani. Adjoint Rewriting. PhD thesis, University of Edinburgh, 1995.
6. N. Ghani, V. de Paiva, and E. Ritter. Linear explicit substitutions. In Proc. of Westapp'98, 1998.
7. N. Ghani, V. de Paiva, and E. Ritter. Models for explicit substitution calculi. Technical report, School of Computer Science, University of Birmingham, 1998.
8. C.K. Gomard. Partial type inference for untyped functional programs. In Proc. ACM conference on Lisp and functional programming, pages 282-287, 1990.
9. J. Goubault-Larrecq. Logical foundations of eval/quote mechanisms, and the modal logic S4. Manuscript, 1996.
10. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
11. P.-A. Mellies. Typed λ-calculi with explicit substitution may not terminate. Proc. of TLCA'95, pages 328-334. LNCS No. 902, 1995.
12. A. Barber. Linear Type Theories, Semantics and Action Calculi. PhD-thesis, LFCS, University of Edinburgh, 1997.
13. A. Barber and G. Plotkin. Dual intuitionistic linear logic. Technical report, LFCS, University of Edinburgh, 1997.
14. F. Nielson and H.R. Nielson. Two-Level Functional Languages. CUP, 1992.
15. J. Palsberg. Correctness of binding-time analysis. J. of Functional Programming, 3(3):347-363, 1993.
16. E. Ritter and V. de Paiva. On explicit substitution and names (extended abstract). In Proc. of ICALP'97, LNCS 1256, pages 248-258, 1997.
17. Eike Ritter. Categorical abstract machines for higher-order lambda calculi. Theoretical Computer Science, 136(1):125-162, 1994.
18. Eike Ritter. Normalization for typed lambda calculi with explicit substitution. In Proc. of CSL'93, pages 295-304. LNCS 832, 1994.