Computer Science Logic
From MaRDI portal
Publication:5292662
DOI10.1007/b13224zbMath1116.03322OpenAlexW2623947920MaRDI QIDQ5292662
Andrew M. Pitts, Christian Urban, Murdoch James Gabbay
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13224
Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Nominal unification, Fresh logic: Proof-theory and semantics for FM and nominal techniques, Nominal rewriting, Binding in Nominal Equational Logic, Nominal unification with atom-variables, An initial algebra approach to term rewriting systems with variable binders, Nominal Unification and Matching of Higher Order Expressions with Recursive Let, Nominal syntax with atom substitutions, Unnamed Item, Rewriting with generalized nominal unification, Binding operators for nominal sets, A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols, Nominal Unification from a Higher-Order Perspective, On a monadic semantics for freshness, Nominal unification with letrec and environment-variables
