HYBRID
From MaRDI portal
Software:13181
swMATH421MaRDI QIDQ13181FDOQ13181
Author name not available (Why is that?)
Cited In (20)
- A case study in programming coinductive proofs: Howe’s method
- Rensets and renaming-based recursion for syntax with bindings
- A linear logic framework for multimodal logics
- A focused linear logical framework and its application to metatheory of object logics
- Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions
- Formalization of metatheory of the Quipper quantum programming language in a linear logic
- Formal meta-level analysis framework for quantum programming languages
- Mechanized metatheory revisited
- Canonical HybridLF: extending Hybrid with dependent types
- Programs Using Syntax with First-Class Binders
- The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
- A formalized general theory of syntax with bindings: extended version
- POPLMark reloaded: Mechanizing proofs by logical relations
- Mechanizing proofs with logical relations – Kripke-style
- Title not available (Why is that?)
- Mechanizing focused linear logic in Coq
- Cut elimination for a logic with induction and co-induction
- A two-level logic approach to reasoning about computations
- Term-generic logic
This page was built for software: HYBRID
