PoplMark
From MaRDI portal
Software:22078
swMATH10109MaRDI QIDQ22078FDOQ22078
Author name not available (Why is that?)
Cited In (66)
- Type Preservation as a Confluence Problem
- Multimodal Separation Logic for Reasoning About Operational Semantics
- Verified analysis of list update algorithms
- Free theorems and runtime type representations
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- Mechanizing the metatheory of mini-XQuery
- Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
- Rensets and renaming-based recursion for syntax with bindings
- A verified framework for higher-order uncurrying optimizations
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- Strong normalization for the simply-typed lambda calculus in constructive type theory using Agda
- Coq formalization of the higher-order recursive path ordering
- Directly reflective meta-programming
- Mechanized metatheory revisited
- Structural Abstract Interpretation: A Formal Study Using Coq
- Modular verification of chemical reaction network encodings via serializability analysis
- Mechanizing metatheory in a logical framework
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
- Mechanizing metatheory without typing contexts
- A formalized general theory of syntax with bindings: extended version
- Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
- Formalizing operational semantic specifications in logic
- The locally nameless representation
- A formalization of multi-tape Turing machines
- \(\mathrm{HO}\pi\) in Coq
- Title not available (Why is that?)
- A list-machine benchmark for mechanized metatheory (extended abstract)
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- Mechanizing type environments in weak HOAS
- Formalizing implicative algebras in Coq
- Formalization of a polymorphic subtyping algorithm
- Modules over monads and initial semantics
- Programming inductive proofs. A new approach based on contextual types
- Reasoning with higher-order abstract syntax and contexts: a comparison
- A Rewriting Logic Approach to Type Inference
- αCheck: A mechanized metatheory model checker
- A Sound Semantics for OCaml light
- Proof assistants: history, ideas and future
- Formalizing semantic bidirectionalization and extensions with dependent types
- Representing and Reasoning with Operational Semantics
- Psi-calculi in Isabelle
- System F in Agda, for fun and profit
- A solution to the PoplMark challenge using de Bruijn indices in Isabelle/HOL
- A solution to the PoplMark challenge based on de Bruijn indices
- Formal metatheory of programming languages in the Matita interactive theorem prover
- Nominal techniques in Isabelle/HOL
- A two-level logic approach to reasoning about computations
- POPLMark reloaded: mechanizing proofs by logical relations
- A list-machine benchmark for mechanized metatheory
- A head-to-head comparison of de Bruijn indices and names
- Nested abstract syntax in Coq
- Explicit contexts in LF (extended abstract)
- A computer-verified monadic functional implementation of the integral
- Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention
- Mechanizing proofs with logical relations -- Kripke-style
- Derivation and inference of higher-order strictness types
- Nominal Inversion Principles
- The Matita interactive theorem prover
- A higher-order abstract syntax approach to verified transformations on functional programs
- Harpoon: mechanizing metatheory interactively
- Term-generic logic
- Initiality for typed syntax and semantics
- Proof Pearl: De Bruijn Terms Really Do Work
- Formalizing mathematical knowledge as a biform theory graph: a case study
- GMeta: a generic formal metatheory framework for first-order representations
- Binding structures as an abstract data type
This page was built for software: PoplMark
