Introduction to higher order categorical logic
Introduction to higher order categorical logic
Proofs and types
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Fixed points and extensionality in typed functional programming languages
Fixed points and extensionality in typed functional programming languages
Lifting Theorems for Kleisli Categories
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Bridging the gulf: a common intermediate language for ML and Haskell
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
A uniform type structure for secure information flow
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cycle therapy: a prescription for fold and unfold on regular trees
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Secrets of the Glasgow Haskell Compiler inliner
Journal of Functional Programming
Call-by-push-value: Decomposing call-by-value and call-by-name
Higher-Order and Symbolic Computation
A uniform type structure for secure information flow
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for which general recursion is possible. The motivations for this work are certain natural constructions in category theory, in particular the notion of an algebraically bounded functor, due to Freyd. We propose that this is a particularly elegant core language in which to work with recursive objects, since the potential for general recursion is contained in a single operator which interacts well with the facilities for bounded iteration and coiteration.