FreshML

swMATH8992MaRDI QIDQ20987FDOQ20987

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=944729

Cited In (63)

• A dependent type theory with abstractable names
• Denotational semantics with nominal Scott domains
• Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
• Matching and alpha-equivalence check for nominal terms
• 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
• Generalised name abstraction for nominal sets
• A universe of binding and computation
• An initial algebra approach to term rewriting systems with variable binders
• Constrained polymorphic types for a calculus with name variables
• A polynomial nominal unification algorithm
• On nominal regular languages with binders
• FreshML: programming with binders made simple
• The locally nameless representation
• Foundations of nominal techniques: logic and semantics of variables in abstract syntax
• A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
• Principal types for nominal theories
• Refined environment classifiers. Type- and scope-safe code generation with mutable cells
• Incremental rebinding with name polymorphism
• Nominal unification
• Structuring operational semantics: simplification and computation
• Rule formats for nominal process calculi
• The First-Order Nominal Link
• Logic Programming
• Hard life with weak binders
• Beluga
• SLMC
• OCaml
• 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
• Pict
• BER MetaOCaml
• ULM
• aleanTAP
• MoMo
• Gmeta
• Nominal Isabelle
• RepLib
• Free-algebra models for the \(\pi \)-calculus
• Qu-Prolog
• Delphin
• FreshOCaml
• HNT
• Unbound
• 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
• Structural recursion with locally scoped names
• Program transformation with scoped dynamic rewrite rules
• 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
• Programming type-safe transformations using higher-order abstract syntax
• Freshness and Name-Restriction in Sets of Traces with Names
• Programs using syntax with first-class binders

This page was built for software: FreshML