The following pages link to Freshml (Q20987):
Displaying 48 items.
- A dependent type theory with abstractable names (Q530845) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Incremental rebinding with name polymorphism (Q737082) (← 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)
- Binding operators for nominal sets (Q1744371) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols (Q1744440) (← links)
- Nominal unification (Q1882909) (← links)
- The locally nameless representation (Q1945914) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Nominal rewriting (Q2373703) (← links)
- A general mathematics of names (Q2373874) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols (Q2424886) (← links)
- Free-algebra models for the \(\pi \)-calculus (Q2474057) (← links)
- Nominal syntax with atom substitutions (Q2662669) (← links)
- A Simple Nominal Type Theory (Q2804939) (← links)
- Nominal Equational Logic (Q2864152) (← links)
- Structuring Operational Semantics: Simplification and Computation (Q2864160) (← links)
- A dependent nominal type theory (Q2881075) (← links)
- On Nominal Regular Languages with Binders (Q2892775) (← links)
- A universe of binding and computation (Q2936809) (← links)
- Programming Type-Safe Transformations Using Higher-Order Abstract Syntax (Q2938052) (← links)
- Programs Using Syntax with First-Class Binders (Q2988654) (← links)
- Freshness and Name-Restriction in Sets of Traces with Names (Q3000621) (← 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)
- Principal Types for Nominal Theories (Q3088280) (← links)
- Refined Environment Classifiers (Q3179298) (← links)
- (Q4580225) (← links)
- Proof-Relevant Logical Relations for Name Generation (Q4637685) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- Generalised Name Abstraction for Nominal Sets (Q4910435) (← links)
- (Q4972733) (← links)
- Hard Life with Weak Binders (Q5170666) (← links)
- A fresh look at programming with names and binders (Q5176942) (← links)
- Binders unbound (Q5176984) (← links)
- Ott: Effective tool support for the working semanticist (Q5189646) (← links)
- FreshML (Q5261281) (← links)
- Acute: High-level programming language design for distributed computation (Q5308092) (← links)
- Foundations of Software Science and Computation Structures (Q5308449) (← links)
- Logic Programming (Q5313189) (← links)
- Denotational aspects of untyped normalization by evaluation (Q5313717) (← links)
- (Q5472912) (← links)
- Denotational Semantics with Nominal Scott Domains (Q5501931) (← links)
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus (Q5747746) (← links)
- Formal Methods for Components and Objects (Q5897447) (← links)
