Explicit substitutions and higher-order syntax

DOI10.1007/s10990-006-8748-4zbMath1105.68021OpenAlexW2108760508MaRDI QIDQ853744

Tarmo Uustalu, Neil Ghani, Makoto Hamana

Publication date: 17 November 2006

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-006-8748-4

zbMATH Keywords

AlgebrasVariable bindingAbstract syntaxExplicit substitutionsMonads

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)

Related Items (9)

Explicit substitutions and higher-order syntax ⋮ Structured handling of scoped effects ⋮ Unnamed Item ⋮ Modules over monads and initial semantics ⋮ Coproducts of Ideal Monads ⋮ Substitution in non-wellfounded syntax with variable binding ⋮ Unnamed Item ⋮ High-level signatures and initial semantics ⋮ Initial Algebra Semantics for Cyclic Sharing Structures

Uses Software

• Haskell

Cites Work

• An abstract framework for environment machines
• Explicit substitutions and higher-order syntax
• A presentation of topoi as algebraic relative to categories or graphs
• Infinite trees and completely iterative theories: A coalgebraic view
• Iteration and coiteration schemes for higher-order and nested datatypes
• Generalised folds for nested datatypes
• On Rational Monads and Free Iterative Theories
• On Iteratable Endofunctors
• Composing monads using coproducts
• de Bruijn notation as a nested datatype
• Free iterative theories: a coalgebraic view
• Dualising initial algebras
• Explicit substitutions
• Parametric corecursion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Explicit substitutions and higher-order syntax