PoplMark
From MaRDI portal
Cited in
(only showing first 100 items - show all)- GMeta: a generic formal metatheory framework for first-order representations
- WANDA
- Mechanizing metatheory without typing contexts
- Multimodal Separation Logic for Reasoning About Operational Semantics
- Mechanizing the metatheory of mini-XQuery
- Nominal Inversion Principles
- scientific article; zbMATH DE number 7204440 (Why is no real title available?)
- System F in Agda, for fun and profit
- \(\mathrm{HO}\pi\) in Coq
- Strong normalization for the simply-typed lambda calculus in constructive type theory using Agda
- Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
- Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention
- A higher-order abstract syntax approach to verified transformations on functional programs
- Verified analysis of list update algorithms
- αCheck: A mechanized metatheory model checker
- Type Preservation as a Confluence Problem
- Initiality for typed syntax and semantics
- Rensets and renaming-based recursion for syntax with bindings
- Binding structures as an abstract data type
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- coq-library-undecidability
- Free theorems and runtime type representations
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- A list-machine benchmark for mechanized metatheory (extended abstract)
- Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
- Proof assistants: history, ideas and future
- Formalizing operational semantic specifications in logic
- Modules over monads and initial semantics
- Programming inductive proofs. A new approach based on contextual types
- A formalized general theory of syntax with bindings: extended version
- Reasoning with higher-order abstract syntax and contexts: a comparison
- The locally nameless representation
- Psi-calculi in Isabelle
- A two-level logic approach to reasoning about computations
- Nested abstract syntax in Coq
- POPLMark reloaded: mechanizing proofs by logical relations
- Modular verification of chemical reaction network encodings via serializability analysis
- A Rewriting Logic Approach to Type Inference
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
- A list-machine benchmark for mechanized metatheory
- A head-to-head comparison of de Bruijn indices and names
- Formalizing semantic bidirectionalization and extensions with dependent types
- 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
- The Matita interactive theorem prover
- Harpoon: mechanizing metatheory interactively
- Representing and Reasoning with Operational Semantics
- Nominal Lawvere theories: a category theoretic account of equational theories with names
- A formalization of multi-tape Turing machines
- HYBRID
- Ott
- Beluga
- TinkerType
- Twelf
- LMNtal
- Mechanizing type environments in weak HOAS
- AURA
- Abella
- Bedwyr
- cminor
- LEGO
- Tac
- Gmeta
- LNgen
- Nominal Isabelle
- RepLib
- CC-Pi
- FreshML
- HOL2P
- Delphin
- MiniAgda
- SPEC
- Teyjus
- Autosubst
- mini-ML
- CRSX
- Unbound
- PureScript
- Psi-calculi
- List Update Algorithms
- Sage
- Flow
- Logipedia
- Visual DSD
- Term-generic logic
- A verified framework for higher-order uncurrying optimizations
- Mechanizing metatheory in a logical framework
- Mechanizing proofs with logical relations -- Kripke-style
- Mechanized metatheory revisited
- Coq formalization of the higher-order recursive path ordering
- Derivation and inference of higher-order strictness types
- Directly reflective meta-programming
- A Sound Semantics for OCaml light
- metalib
- Harpoon
- Proof Pearl: De Bruijn Terms Really Do Work
- Formalizing implicative algebras in Coq
- Formalization of a polymorphic subtyping algorithm
This page was built for software: PoplMark
