Information and Computation - Semantics of Data Types
A framework for defining logics
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 2)
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
CPS Translations and Applications: The Cube and Beyond
Higher-Order and Symbolic Computation
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
Eta-Expansions in Dependent Type Theory - The Calculus of Constructions
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
Existence and Uniqueness of Normal Forms in Pure Type Systems with betaeta-Conversion
Proceedings of the 12th International Workshop on Computer Science Logic
Continuation Semantics in Typed Lambda-Calculi (Summary)
Proceedings of the Conference on Logic of Programs
Type-checking injective pure type systems
Journal of Functional Programming
Expansion postponement for normalising pure type systems
Journal of Functional Programming
CPS Translations and Applications: The Cube and Beyond
Higher-Order and Symbolic Computation
Type-checking injective pure type systems
Journal of Functional Programming
Hi-index | 5.23 |
We present an induction principle for pure type systems and use that principle to define CPS translations and to solve the problem of expansion postponement for a large class of pure type systems. Our principle strengthens and generalises similar principles by Dowek et al. [12] and Barthe et al. [6], which have been respectively used to define &eegr;-long normal forms and CPS translations for the systems of Barendregt's λ-cube [2; 3]. Copyright 2001 Elsevier Science B.V.