Pages that link to "Item:Q699761"

The following pages link to A new approach to abstract syntax with variable binding (Q699761):

Displaying 50 items.

• Confluence and commutation for nominal rewriting systems with atom-variables (Q2119102) (← links)
• A program logic for fresh name generation (Q2145263) (← links)
• A lazy desugaring system for evaluating programs with sugars (Q2163178) (← links)
• Properties of the atoms in finitely supported structures (Q2288339) (← links)
• Mechanized metatheory revisited (Q2323447) (← links)
• Formal metatheory of the lambda calculus using Stoughton's substitution (Q2358702) (← links)
• Fresh logic: Proof-theory and semantics for FM and nominal techniques (Q2372191) (← links)
• Nominal rewriting (Q2373703) (← links)
• A general mathematics of names (Q2373874) (← links)
• Encoding abstract syntax without fresh names (Q2392477) (← links)
• Formalizing adequacy: a case study for higher-order abstract syntax (Q2392483) (← links)
• Reachability in pushdown register automata (Q2396722) (← links)
• Nominal Lawvere theories: a category theoretic account of equational theories with names (Q2453579) (← links)
• Behavioural equivalences for dynamic web data (Q2474049) (← links)
• Free-algebra models for the \(\pi \)-calculus (Q2474057) (← links)
• A game semantics of names and pointers (Q2474444) (← links)
• On a monadic semantics for freshness (Q2566026) (← links)
• Reasoning about object-based calculi in (co)inductive type theory and the theory of contexts (Q2642466) (← links)
• Nominal syntax with atom substitutions (Q2662669) (← links)
• A simple nominal type theory (Q2804939) (← links)
• Two cotensors in one: presentations of algebraic theories for local state and fresh names (Q2805171) (← links)
• A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
• Nominal Confluence Tool (Q2817917) (← links)
• A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) (Q2830029) (← links)
• The theory of contexts for first order and higher order abstract syntax (Q2841274) (← links)
• Nominal equational logic (Q2864152) (← links)
• Bialgebraic methods in structural operational semantics (invited talk) (Q2866314) (← links)
• A name abstraction functor for named sets (Q2873662) (← links)
• Functorial coalgebraic logic: the case of many-sorted varieties (Q2873668) (← links)
• Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
• Relating Coalgebraic Notions of Bisimulation (Q2888487) (← links)
• Nominal Automata for Resource Usage Control (Q2914700) (← links)
• Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free (Q2915895) (← links)
• Families of symmetries as efficient models of resource binding (Q2919450) (← links)
• A Library of Anti-unification Algorithms (Q2938520) (← links)
• Block structure vs scope extrusion: between innocence and omniscience (Q2974774) (← links)
• Algorithmic Nominal Game Semantics (Q3000592) (← 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)
• Mechanizing the Metatheory of mini-XQuery (Q3100214) (← links)
• Binding in Nominal Equational Logic (Q3178258) (← links)
• A Nominal Relational Model for Local Store (Q3178267) (← links)
• New (Q3178271) (← links)
• Game Semantics in the Nominal Model (Q3178282) (← links)
• A System-Level Game Semantics (Q3178283) (← links)
• A Category of Explicit Fusions (Q3507388) (← links)
• Ugo Montanari and Software Verification (Q3507392) (← links)