Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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/s10990-006-8745-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981019433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residual theory in λ-calculus: a formal development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem proving in higher order logics. 18th international conference, TPHOLs 2005, Oxford, UK, August 22--25, 2005. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some lambda calculus and type theory formalized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining functions on equivalence classes / 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: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective) / rank
 
Normal rank

Revision as of 22:16, 24 June 2024

scientific article
Language Label Description Also known as
English
Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations
scientific article

    Statements

    Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (English)
    0 references
    0 references
    17 November 2006
    0 references
    Barendregt variable convention
    0 references

    Identifiers