Nominal techniques in Isabelle/HOL (Q928672): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PoplMark / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-008-9097-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037026294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering formal metatheory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus, its syntax and semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalising the π-Calculus Using Nominal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher order unification via explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to abstract syntax with variable binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunction and existence under implication in elementary intuitionistic formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal logic, a first order theory of names and binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-structural recursion and induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel reductions in \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design and implementation of typed scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barendregt’s Variable Convention in Rule Inductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Induction Proofs in Isabelle/Isar / rank
 
Normal rank

Latest revision as of 10:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Nominal techniques in Isabelle/HOL
scientific article

    Statements

    Nominal techniques in Isabelle/HOL (English)
    0 references
    0 references
    11 June 2008
    0 references
    Lambda-calculus
    0 references
    Nominal logic work
    0 references
    Theorem provers
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers