Corpus ID: 9969779

Lambda-Free Logical Frameworks

  title={Lambda-Free Logical Frameworks},
  author={Robin Adams},
  • Robin Adams
  • Published 2008
  • Mathematics, Computer Science
  • ArXiv
We present the denition of the logical framework TF, the Type Framework. TF is a lambda-free logical framework; it does not include lambda-abstraction or product kinds. We give formal proofs of several results in the metatheory of TF, and show how it can be conservatively embedded in the logical framework LF: its judgements can be seen as the judgements of LF that are in beta-normal, eta-long normal form. We show how several properties, such as the injectivity of constants and the strong… Expand
Coercive subtyping in lambda-free logical frameworks
Instances of Computational Effects: An Algebraic Perspective
  • S. Staton
  • Mathematics, Computer Science
  • 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2013
An Algebraic Presentation of Predicate Logic - (Extended Abstract)
  • S. Staton
  • Mathematics, Computer Science
  • FoSSaCS
  • 2013
Compositional Semantics for Probabilistic Programs with Exact Conditioning


PAL+: a lambda-free logical framework
  • Z. Luo
  • Computer Science
  • Journal of Functional Programming
  • 2003
A framework for defining logics
A Bidirectional Refinement Type System for LF
Mechanizing metatheory in a logical framework
Structural subtyping for inductive types with functorial equality rules†
  • Z. Luo, Robin Adams
  • Computer Science, Mathematics
  • Mathematical Structures in Computer Science
  • 2008
A Modular Hierarchy of Logical Frameworks
Curry-Style Types for Nominal Terms
A Formulation of the Simple Theory of Types
  • A. Church
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1940
Computation and reasoning - a type theory for computer science
  • Z. Luo
  • Computer Science
  • International series of monographs on computer science
  • 1994
Programming in Martin-Lo¨f's type theory: an introduction