Comparing higher-order encodings in logical frameworks and tile logic
From MaRDI portal
Recommendations
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Encoding modal logics in logical frameworks
- Expressibility of higher order logics
- scientific article; zbMATH DE number 1089034
- Higher-order representation of substructural logics
- scientific article; zbMATH DE number 4047723
- Reasoning with higher-order abstract syntax in a logical framework
- scientific article; zbMATH DE number 1926604
- Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Cites work
- -calculus in (Co)inductive-type theory
- A calculus of mobile processes. II
- A framework for defining logics
- A natural extension of natural deduction
- A theory of bisimulation for the -calculus
- An interactive semantics of logic programming
- Comparing cospan-spans and tiles via a Hoare-style process calculus
- Compositional SOS and beyond: A coalgebraic view of open systems
- Conditional rewriting logic as a unified model of concurrency
- Full abstraction in the lazy lambda calculus
- scientific article; zbMATH DE number 1189279 (Why is no real title available?)
- scientific article; zbMATH DE number 1231660 (Why is no real title available?)
- scientific article; zbMATH DE number 1531624 (Why is no real title available?)
- scientific article; zbMATH DE number 1754648 (Why is no real title available?)
- scientific article; zbMATH DE number 1759616 (Why is no real title available?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Using typed lambda calculus to implement formal systems on a machine
Cited in
(3)
This page was built for publication: Comparing higher-order encodings in logical frameworks and tile logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841275)