Abstract
An extension of the simply-typed λ-calculus, allowing iteration and case reasoning over terms of functional types that arise when using higher order abstract syntax, has recently been introduced by F. Pfenning, C. Schürmann and the first author. This thorny mixing is achieved thanks to the help of the operator ‘□’ of modal logic S4. Here we give a new presentation of their system, with reduction rules, instead of evaluation judgments, that compute the canonical forms of terms. Our presentation is based on a modal λ-calculus that is better from the user’s point of view. Moreover we do not impose a particular strategy of reduction during the computation. Our system enjoys the decidability of typability, soundness of typed reduction with respect to typing rules, the Church-Rosser and strong normalization properties and it is a conservative extension over the simply-typed λ-calculus.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Akama. On Mints’ reduction for ccc-calculus. In Proceedings TLCA, pages 1–12. Springer-Verlag LNCS 664, 1993. 54
Gavin Bierman and Valeria de Paiva. Intuitionistic necessity revisited. In Technical Report CSRP-96-10, School of Computer Science, University of Birmingham, June 1996. 48
R. Di Cosmo and D. Kesner. A Confluent Reduction for the Extensional Typed λ-calculus. In Proceedings ICALP’93. Springer-Verlag LNCS 700, 1993. 54
J. Despeyroux and A. Hirschowitz. Higher-order syntax and induction in coq. In F. Pfenning, editor, Proceedings of the fifth Int. Conf. on Logic Programming and Automated Reasoning (LPAR 94), Kiev, Ukraine, July 16–21, 1994, volume 822. Springer-Verlag LNAI, 1994. 50, 53, 59
Joëlle Despeyroux and Pierre Leleu. Primitive recursion for higher-order abstract syntax-dependant types. Draft, submitted for publication, 1999. 60
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Jr. Guy Steele, editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258–270, St. Petersburg Beach, Florida, January 1996. ACM Press. 48
Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. Technical Report CMU-CS-96-172, Carnegie Mellon University, September 1996. 52
Joëlle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive Recursion for Higher-Order Abstract Syntax. In J.R. Hindley and P. de Groote, editors, Int. Conf. on Typed lambda calculi and applications-TLCA’97, pages 147–163, Nancy, France, April 1997. Springer-Verlag LNCS 1210. 47, 48, 49, 53, 59, 60
Neil Ghani. Eta Expansions in System F. Technical Report LIENS-96-10, LIENS-DMI, Ecole Normale Superieure, 1996. 48, 55, 56
Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge University Press, 1989. 56
Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143–184, January 1993. 48, 49
Martin Hofmann. Semantical analysis of higher-order abstract syntax. In IEEE, editor, Proceedings of the International Conference on Logic In Computer Sciences, LICS, 1999. 59, 60
C.B. Jay and N. Ghani. The Virtues of Eta-Expansion. Journal of Functional Programming, 5(2):135–154, April 1995. 48, 54, 56
Pierre Leleu. A Modal Lambda Calculus with Iteration and Case Constructs. Technical Report RR-3322, INRIA, France, December 1997. http://www.inria.fr/RRRT/RR-3322.html. 48, 52, 57, 58
Pierre Leleu. Metatheoretic Results for a Modal Lambda Calculus. Technical Report RR-3361, INRIA, France, 1998. http://www.inria.fr/RRRT/RR-3361.html. 54
Pierre Leleu. Syntaxe abstraite d’ordre supérieur et récursion dans les théories typées. Phd thesis, Ecole Nationale des Ponts et Chaussées (ENPC), December 1998. In French. 60
Zhaohui Luo. Computation and Reasoning. Oxford University Press, 1994. 49
Raymond McDowell and Dale Miller. A logic for reasoning with higher-order abstract syntax. In Proceedings of LICS’97, pages 434–445, Warsaw, 1997. 59
Lena Magnusson and Bengt Nordström. The ALF proof editor and its proof engine. In Henk Barendregt and Tobias Nipkow, editors, Types for Proofs and Programs, pages 213–237. Springer-Verlag LNCS 806, 1994. 60
M.H.A. Newman. On theories with a combinatorial definition of ‘equivalence’. Ann. Math., 43(2):223–243, 1942. 58
Bengt Nordström, Kent Petersson, and Jan Smith. Programming in Martin-Löf’ s Type Theory: An Introduction. Oxford University Press, 1990. 47, 60
Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN’ 88 Symposium on Language Design and Implementation, pages 199–208, Atlanta, Georgia, June 1988. 47
Ch. Paulin-Mohring. Inductive definitions in the system coq. rules and properties. In J.F. Groote M. Bezem, editor, Proceedings of the Int. Conf. on Typed Lambda Calculi and Applications, TLCA’93, Springer-Verlag LNCS 664, 1992. 47
F. Pfenning and C. Schürmann. Automated Theorem Proving in a Simple Meta Logic for LF. In Proceedings of the CADE-15 Conference, Lindau-Germany, July 1998. 59
Frank Pfenning and Hao-Chi Wong. On a modal λ-calculus for S4. In S. Brookes and M. Main, editors, Proceedings of the Eleventh Conference on Mathematical Foundations of Programming Sematics, New Orleans, Louisiana, March 1995. To appear in Electronic Notes in Theoretical Computer Science, Volume 1, Elsevier. 48, 49, 51, 52
Benjamin Werner. Une Théorie des Constructions Inductives. PhD thesis, Université Paris 7, 1994. 47, 49, 55
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Despeyroux, J., Leleu, P. (1999). A Modal Lambda Calculus with Iteration and Case Constructs. In: Altenkirch, T., Reus, B., Naraschewski, W. (eds) Types for Proofs and Programs. TYPES 1998. Lecture Notes in Computer Science, vol 1657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48167-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-48167-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66537-3
Online ISBN: 978-3-540-48167-6
eBook Packages: Springer Book Archive