Handbook of logic in computer science (vol. 2)
On the type structure of standard ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation
Checking algorithms for pure type systems
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Type inference for pure type systems
Information and Computation
An induction principle for pure type systems
Theoretical Computer Science
The Semi-Full Closure of Pure Type Systems
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Expansion postponement for normalising pure type systems
Journal of Functional Programming
An induction principle for pure type systems
Theoretical Computer Science
Type Isomorphisms and Proof Reuse in Dependent Type Theory
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
An Introduction to Dependent Type Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A computational view of implicit coercions in type theory
Mathematical Structures in Computer Science
Expansion postponement via cut elimination in sequent calculi for pure type systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Interfacing Coq + SSReflect with GAP
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Injective pure type systems form a large class of pure type systems for which one can compute by purely syntactic means two sorts elmt(Γ∣M) and sort(Γ∣M), where Γ is a pseudo-context and M is a pseudo-term, and such that for every sort s,formula to be displayed hereBy eliminating the problematic clause in the (abstraction) rule in favor of constraints over elmt(.∣.) and sort(.∣.), we provide a sound and complete type-checking algorithm for injective pure type systems. In addition, we prove expansion postponement for a variant of injective pure type systems where the problematic clause in the (abstraction) rule is replaced in favor of constraints over elmt(.∣.) and sort(.∣.).