POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q113857457, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalization for the Simply-Typed Lambda-Calculus in Twelf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4995161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copatterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Irrelevance and Algorithmic Equality in Predicative Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formalized Proof of Strong Normalization for Guarded Recursive Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for Proofs and Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3593499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type- and scope-safe universe of syntaxes with binding: their semantics and proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Monads Formalised / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monads need not be endofunctors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorical reconstruction of a reduction free normalization proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type theory in type theory using quotient inductive types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5371043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4816996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Psi-calculi in Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly typed term representations in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program extraction from normalization proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for Proofs and Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Friends with Benefits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with binders and indexed data-types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing proofs with logical relations – Kripke-style / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear logical framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type Theory Should Eat Itself / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gentle art of levitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The locally nameless representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: αCheck: A mechanized metatheory model checker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric higher-order abstract syntax for mechanized semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong normalization of substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next 700 challenge problems for reasoning with higher-order abstract syntax representations. II: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computational Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalence and canonical forms in the LF type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of parameterization in coinductive proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: CakeML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a mechanized metatheory of standard ML / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMeta: A Generic Formal Metatheory Framework for First-Order Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universe of binding and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization of metatheory of the Quipper quantum programming language in a linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and program transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kripke-style models for typed lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A case study in programming coinductive proofs: Howe’s method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contextual modal type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2871867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependently Typed Programming in Agda / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logical relations and observational equivalences for session-based concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying termination and reduction properties about higher-order logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fresh look at programming with names and binders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal equational theory for call-by-push-value / rank
 
Normal rank
Property / cites work
 
Property / cites work: F-ing modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof search specifications of bisimulation and modal logics for the π-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Bindings and Alpha-Equivalence in Nominal Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing the metatheory of LF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for Proofs and Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binders unbound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for Proofs and Programs / rank
 
Normal rank

Revision as of 18:49, 22 July 2024

scientific article; zbMATH DE number 7203388
Language Label Description Also known as
English
POPLMark reloaded: Mechanizing proofs by logical relations
scientific article; zbMATH DE number 7203388

    Statements

    POPLMark reloaded: Mechanizing proofs by logical relations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references