Compiling with continuations
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
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
Strong normalization from weak normalization in typed &lgr;-calculi
Information and Computation
Second-order unification and type inference for Church-style polymorphism
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
CPS Translations and Applications: The Cube and Beyond
Higher-Order and Symbolic Computation
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
The Undecidability of Typability in the Lambda-Pi-Calculus
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Simplification of Girard's Paradox
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Extensions of Pure Type Systems
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
Elf: A Meta-Language for Deductive Systems (System Descrition)
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CPS translating inductive and coinductive types
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
An Implementation of LF with Coercive Subtyping & Universes
Journal of Automated Reasoning
An Introduction to Dependent Type Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Remarks on the equational theory of non-normalizing pure type systems
Journal of Functional Programming
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Existential Type Systems with No Types in Terms
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
The not so simple proof-irrelevant model of CC
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Type checking and inference for polymorphic and existential types
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
A Partial Type Checking Algorithm for Type: Type
Electronic Notes in Theoretical Computer Science (ENTCS)
Type checking and typability in domain-free lambda calculi
Theoretical Computer Science
On the role of type decorations in the calculus of inductive constructions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Type checking and inference are equivalent in lambda calculi with existential types
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
Pure type systems make use of domain-full λ-abstractions λx:D.M. We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free λ-abstractions λx.M. Domain-free pure type systems have a number of advantages over both pure type systems and so-called type assignment systems (they also have some disadvantages), and have been used in theoretical developments as well as in implementations of proof-assistants. We study the basic properties of domain-free pure type systems, establish their formal relationship with pure type systems and type assignment systems, and give a number of applications of these correspondences.