Freshml

swMATH8992MaRDI QIDQ20987FDOQ20987

Author name not available (Why is that?)

Cited In (48)

• FreshML
• A dependent type theory with abstractable names
• Title not available (Why is that?)
• Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
• Matching and alpha-equivalence check for nominal terms
• Hard Life with Weak Binders
• Formal Methods for Components and Objects
• Mechanized metatheory revisited
• Binding operators for nominal sets
• A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols
• A universe of binding and computation
• An initial algebra approach to term rewriting systems with variable binders
• Programs Using Syntax with First-Class Binders
• A polynomial nominal unification algorithm
• The locally nameless representation
• A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
• Incremental rebinding with name polymorphism
• Nominal unification
• Structuring operational semantics: simplification and computation
• Programming Type-Safe Transformations Using Higher-Order Abstract Syntax
• The First-Order Nominal Link
• Logic Programming
• Relating state-based and process-based concurrency through linear logic (full-version)
• Ott: Effective tool support for the working semanticist
• Nominal syntax with atom substitutions
• Free-algebra models for the \(\pi \)-calculus
• On Nominal Regular Languages with Binders
• Binders unbound
• A simple nominal type theory
• Foundations of Software Science and Computation Structures
• Nominal rewriting
• Validating Brouwer's continuity principle for numbers using named exceptions
• Nominal equational logic
• A dependent nominal type theory
• A general mathematics of names
• Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
• Structural recursion with locally scoped names
• Principal Types for Nominal Theories
• Program transformation with scoped dynamic rewrite rules
• Refined Environment Classifiers
• Acute: High-level programming language design for distributed computation
• Denotational aspects of untyped normalization by evaluation
• A fresh look at programming with names and binders
• Denotational Semantics with Nominal Scott Domains
• Proof-Relevant Logical Relations for Name Generation
• Generalised Name Abstraction for Nominal Sets
• Freshness and Name-Restriction in Sets of Traces with Names
• Title not available (Why is that?)

This page was built for software: Freshml