The following pages link to (Q2721104):
Displaying 22 items.
- A dependent type theory with abstractable names (Q530845) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Formal compiler construction in a logical framework (Q853741) (← links)
- An initial algebra approach to term rewriting systems with variable binders (Q853743) (← links)
- A polynomial nominal unification algorithm (Q944382) (← links)
- Matching and alpha-equivalence check for nominal terms (Q980937) (← links)
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets (Q1006642) (← links)
- The lambda-context calculus (extended version) (Q1044184) (← links)
- Binding operators for nominal sets (Q1744371) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- Nominal logic, a first order theory of names and binding (Q1887151) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Encoding abstract syntax without fresh names (Q2392477) (← links)
- A survey of strategies in rule-based program transformation systems (Q2456575) (← links)
- Nominal syntax with atom substitutions (Q2662669) (← links)
- A simple nominal type theory (Q2804939) (← links)
- A survey of rewriting strategies in program transformation systems (Q2841225) (← links)
- Manipulating trees with hidden labels (Q2864150) (← links)
- Contextual equivalence for inductive definitions with binders in higher order typed functional programming (Q2875221) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- Denotational Semantics with Nominal Scott Domains (Q5501931) (← links)
- A metalanguage for guarded iteration (Q5918344) (← links)
