The following pages link to Twelf (Q18957):
Displayed 50 items.
- Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq (Q3612436) (← links)
- A Formal Calculus for Informal Equality with Binding (Q3612660) (← links)
- An Interpretation of Isabelle/HOL in HOL Light (Q3613409) (← links)
- First-Order Logic with Dependent Types (Q3613421) (← links)
- (Q3656423) (← links)
- (Q4223031) (← links)
- (Q4249901) (← links)
- A Linear Spine Calculus (Q4444935) (← links)
- (Q4445765) (← links)
- (Q4457444) (← links)
- A fully adequate shallow embedding of the π-calculus in Isabelle/HOL with mechanized syntax analysis (Q4457837) (← links)
- (Q4539625) (← links)
- (Q4539626) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- Termination checking with types (Q4659886) (← links)
- (Q4809074) (← links)
- (Q4812964) (← links)
- Dependent types ensure partial correctness of theorem provers (Q4819651) (← links)
- Building reliable, high-performance networks with the Nuprl proof development system (Q4819652) (← links)
- (Q4823135) (← links)
- An Improved Proof-Theoretic Compilation of Logic Programs (Q4911140) (← links)
- Producing Certified Functional Code from Inductive Specifications (Q4916053) (← links)
- Proof Pearl: Abella Formalization of λ-Calculus Cube Property (Q4916060) (← links)
- Efficient Substitution in Hoare Logic Expressions (Q4921508) (← links)
- (Q4944858) (← links)
- Intuitionistic Letcc via Labelled Deduction (Q4982116) (← links)
- Formalizing Operational Semantic Specifications in Logic (Q4982629) (← links)
- In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming (Q5108530) (← links)
- (Q5111317) (← links)
- Elaborating intersection and union types (Q5168879) (← links)
- Ott (Q5168920) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← links)
- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method (Q5191105) (← links)
- Combining Source, Content, Presentation, Narration, and Relational Representation (Q5200120) (← links)
- Project Abstract: Logic Atlas and Integrator (LATIN) (Q5200129) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- On equivalence and canonical forms in the LF type theory (Q5277716) (← links)
- Contextual modal type theory (Q5277812) (← links)
- Lax Theory Morphisms (Q5277906) (← links)
- $\mathsf{LLF}_{\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads (Q5278085) (← links)
- Mechanizing metatheory in a logical framework (Q5308093) (← links)
- Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative (Q5310654) (← links)
- Automating Theorem Proving with SMT (Q5327333) (← links)
- Functions-as-constructors Higher-order Unification (Q5369491) (← links)
- No value restriction is needed for algebraic effects and handlers (Q5372003) (← links)
- The calculus of dependent lambda eliminations (Q5372010) (← links)
- An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf (Q5387890) (← links)
- Computer Science Logic (Q5394569) (← links)
- A logical framework combining model and proof theory (Q5400853) (← links)
- Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism (Q5437034) (← links)