Information and Computation - Semantics of Data Types
ECC, and extended calculus of constructions
Proceedings of the Fourth Annual Symposium on Logic in computer science
Handbook of logic in computer science (vol. 2)
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Full abstraction in the lazy lambda calculus
Information and Computation
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Journal of Logic, Language and Information
Pure Type Systems with Definitions
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Structural Recursive Definitions in Type Theory
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Infinitary Lambda Calculi and Böhm Models
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Productivity of stream definitions
Theoretical Computer Science
Infinitary Combinatory Reduction Systems
Information and Computation
A semantic model for graphical user interfaces
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Ultrametric Semantics of Reactive Programs
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Higher-order functional reactive programming in bounded space
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Productive coprogramming with guarded recursion
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Circular coinduction in coq using bisimulation-up-to techniques
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Type-Based Productivity of Stream Definitions in the Calculus of Constructions
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
In this paper, we use types for ensuring that programs involving streams are well-behaved. We extend pure type systems with a type constructor for streams, a modal operator next and a fixed point operator for expressing corecursion. This extension is called Pure Type Systems with Corecursion (CoPTS). The typed lambda calculus for reactive programs defined by Krishnaswami and Benton can be obtained as a CoPTS. CoPTSs allow us to study a wide range of typed lambda calculi extended with corecursion using only one framework. In particular, we study this extension for the calculus of constructions which is the underlying formal language of Coq. We use the machinery of infinitary rewriting and formalise the idea of well-behaved programs using the concept of infinitary normalisation. The set of finite and infinite terms is defined as a metric completion. We establish a precise connection between the modal operator (• A) and the metric at a syntactic level by relating a variable of type (• A) with the depth of all its occurrences in a term. This syntactic connection between the modal operator and the depth is the key to the proofs of infinitary weak and strong normalisation.