Pages that link to "Item:Q1887151"
From MaRDI portal
The following pages link to Nominal logic, a first order theory of names and binding (Q1887151):
Displaying 50 items.
- On a monadic semantics for freshness (Q2566026) (← links)
- Nominal syntax with atom substitutions (Q2662669) (← links)
- A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs (Q2802499) (← links)
- A simple nominal type theory (Q2804939) (← links)
- On the role of names in reasoning about \(\lambda\)-tree syntax specifications (Q2804945) (← links)
- Nominal Confluence Tool (Q2817917) (← links)
- A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) (Q2830029) (← links)
- Nominal equational logic (Q2864152) (← links)
- Undecidability of model checking in brane logic (Q2864500) (← links)
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
- Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free (Q2915895) (← links)
- An extension of a permutative model of set theory (Q2919602) (← links)
- Permissive-nominal logic (Q2946669) (← links)
- Programs Using Syntax with First-Class Binders (Q2988654) (← links)
- The First-Order Nominal Link (Q3003496) (← links)
- Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax (Q3011103) (← links)
- Structural recursion with locally scoped names (Q3016213) (← links)
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables (Q3094165) (← links)
- Broadcast Psi-calculi with an Application to Wireless Protocols (Q3095234) (← links)
- Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem (Q3100205) (← links)
- Binding in Nominal Equational Logic (Q3178258) (← links)
- Nominal SOS (Q3178277) (← links)
- Ugo Montanari and Software Verification (Q3507392) (← links)
- Implementing Spi Calculus Using Nominal Techniques (Q3507444) (← links)
- Nominal Matching and Alpha-Equivalence (Q3511452) (← links)
- A Compiled Implementation of Normalization by Evaluation (Q3543648) (← links)
- Nominal Inversion Principles (Q3543650) (← links)
- (Q3609632) (← links)
- Nominal (Universal) Algebra: Equational Logic with Names and Binding (Q3656778) (← links)
- The nominal/FM Yoneda Lemma (Q4988443) (← links)
- Fixed-Point Constraints for Nominal Equational Unification (Q4993333) (← links)
- Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention (Q5022932) (← links)
- (Q5089025) (← links)
- Formal SOS-Proofs for the Lambda-Calculus (Q5178966) (← links)
- (Q5216313) (← links)
- Constructing weak simulations from linear implications for processes with private names (Q5236556) (← links)
- Abstract Syntax: Substitution and Binders (Q5262926) (← links)
- Logic Programming (Q5313189) (← links)
- Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes (Q5351969) (← links)
- a-Logic With Arrows (Q5403474) (← links)
- Higher-order psi-calculi (Q5740353) (← links)
- Modules over relative monads for syntax and semantics (Q5741555) (← links)
- (Q5856409) (← links)
- A linear logic framework for multimodal logics (Q5889307) (← links)
- Psi-calculi in Isabelle (Q5890661) (← links)
- Nominal Unification from a Higher-Order Perspective (Q5892169) (← links)
- General Bindings and Alpha-Equivalence in Nominal Isabelle (Q5892493) (← links)
- Psi-calculi in Isabelle (Q5895110) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Rensets and renaming-based recursion for syntax with bindings extended version (Q6111524) (← links)
