Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
From MaRDI portal
Publication:3094165
DOI10.1017/S0960129511000272zbMath1228.68022OpenAlexW2109877515MaRDI QIDQ3094165
Publication date: 21 October 2011
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129511000272
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free ⋮ Unity in nominal equational reasoning: the algebra of equality on nominal sets ⋮ PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
Cites Work
- Unnamed Item
- A theory of binding structures and applications to rewriting
- A new approach to abstract syntax with variable binding
- Capture-avoiding substitution as a nominal algebra
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
- An algebraic generalization of Frege structures -- binding algebras
- Nominal unification
- Nominal logic, a first order theory of names and binding
- Nominal rewriting
- A general mathematics of names
- Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
- Capture-Avoiding Substitution as a Nominal Algebra
- A Nominal Axiomatization of the Lambda Calculus
- Applying Universal Algebra to Lambda Calculus
- Nominal (Universal) Algebra: Equational Logic with Names and Binding
- Descente Infinie + Deduction
- Two-level Lambda-calculus
- Contextual modal type theory
- Term Equational Systems and Logics
- Completeness and Herbrand theorems for nominal logic
This page was built for publication: Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
