Pages that link to "Item:Q699761"

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

Displaying 42 items.

• Nominal Matching and Alpha-Equivalence (Q3511452) (← links)
• Pure Pointer Programs with Iteration (Q3540172) (← links)
• Bunched polymorphism (Q3545274) (← links)
• Full Abstraction for Reduced ML (Q3617719) (← links)
• Nominal Domain Theory for Concurrency (Q3644772) (← links)
• αCheck: A mechanized metatheory model checker (Q4593089) (← links)
• Proof-Relevant Logical Relations for Name Generation (Q4637685) (← links)
• Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
• Towards Nominal Abramsky (Q4922085) (← links)
• (Q4969297) (← links)
• (Q4972733) (← links)
• (Q4972736) (← links)
• Term Sequent Logic (Q4982627) (← links)
• Two-level Lambda-calculus (Q4982628) (← links)
• The nominal/FM Yoneda Lemma (Q4988443) (← links)
• Fixed-Point Constraints for Nominal Equational Unification (Q4993333) (← links)
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
• On nominal sets with support-preorder (Q5053424) (← links)
• Algebras of UTxO blockchains (Q5084313) (← links)
• (Q5101336) (← links)
• Coverability Synthesis in Parametric Petri Nets (Q5111622) (← links)
• (Q5141619) (← links)
• Hard Life with Weak Binders (Q5170666) (← links)
• (Q5216313) (← links)
• Abstract Syntax: Substitution and Binders (Q5262926) (← links)
• Coalgebraic Modal Logic Beyond Sets (Q5262938) (← links)
• Reasoning about multi-stage programs (Q5371979) (← links)
• a-Logic With Arrows (Q5403474) (← links)
• Completeness and Herbrand theorems for nominal logic (Q5477637) (← links)
• Denotational Semantics with Nominal Scott Domains (Q5501931) (← links)
• (Q5856418) (← links)
• (Q5875359) (← links)
• Generic Authenticated Data Structures, Formally. (Q5875417) (← links)
• Psi-calculi in Isabelle (Q5890661) (← links)
• Fast computations on ordered nominal sets (Q5918532) (← links)
• When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
• The fresh-graph of a nominal set (Q6059081) (← links)
• Nominal Sets in Agda - A Fresh and Immature Mechanization (Q6118749) (← links)
• The reflective higher-order calculus: encodability, typability and separation (Q6124241) (← links)
• Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications (Q6178717) (← links)
• A generic type system for higher-order \(\Psi\)-calculi (Q6614878) (← links)
• Probability monads with submonads of deterministic states (Q6649470) (← links)