Domain-free pure type systems

@article{Barthe2000DomainfreePT,
  title={Domain-free pure type systems},
  author={G. Barthe and M. S{\o}rensen},
  journal={J. Funct. Program.},
  year={2000},
  volume={10},
  pages={417-452}
}
Pure type systems feature domain-specified λ-abstractions λx:A.M. We present a variant of pure type systems, which we call domain-free pure type systems, with domain-free λ-abstractions λx.M. We study the basic properties of domain-free pure type systems and establish their formal relationship with pure type systems. 

Tables and Topics from this paper

Domain-free pure type systems
The Semi-Full Closure of Pure Type Systems
  • G. Barthe
  • Mathematics, Computer Science
  • MFCS
  • 1998
A Partial Type Checking Algorithm for Type: Type
Pure type systems with explicit substitutions
An induction principle for pure type systems
Domain-Free ??-Calculus
Type checking and typability in domain-free lambda calculi
CPS Translations and Applications: The Cube and Beyond
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 69 REFERENCES
Extensions of Pure Type Systems
  • G. Barthe
  • Mathematics, Computer Science
  • TLCA
  • 1995
A - Translation and Looping Combinators in Pure Type Systems
A notion of classical pure type system
CPS Translations and Applications: The Cube and Beyond
Characterization of typings in polymorphic type discipline
  • P. Giannini, S. D. Rocca
  • Mathematics, Computer Science
  • [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
  • 1988
Introduction to Generalized Type Systems
Computation and reasoning - a type theory for computer science
  • Z. Luo
  • Computer Science
  • International series of monographs on computer science
  • 1994
On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study
  • H. Geuvers, Benjamin Werner
  • Mathematics, Computer Science
  • Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science
  • 1994
...
1
2
3
4
5
...