Substitution in non-wellfounded syntax with variable binding

Authors:
Ralph Matthes;Tarmo Uustalu
Affiliations:
Institut für Informatik der Ludwig-Maximilians Universität München, Oettingenstraße 67, D-80538 München, Germany;Institute of Cybernetics at Tallinn University of Technology, Akadeemia tee 21, EE-12618 Tallinn, Estonia
Venue:
Theoretical Computer Science - Selected papers of CMCS'03
Year:
2004

Citing 23
Cited 9

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A framework for defining logics

Journal of the ACM (JACM)
Substitution: a formal methods case study using monads and transformations

TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Infinitary lambda calculus

NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
An algebraic generalization of Frege structures—binding algebras

Theoretical Computer Science
From fast exponentiation to square matrices: an adventure in types

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Parametric corecursion

Theoretical Computer Science
Semantic analysis of normalisation by evaluation for typed lambda calculus

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
The dual of substitution is redecoration

Trends in functional programming
An Extensional Böhm Model

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
On Continuous Normalization

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Nested Datatypes

MPC '98 Proceedings of the Mathematics of Program Construction
Algebras and coalgebras

Algebraic and coalgebraic methods in the mathematics of program construction
Semantical Analysis of Higher-Order Abstract Syntax

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Infinite trees and completely iterative theories: a coalgebraic view

Theoretical Computer Science
A framework for typed HOAS and semantics

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Dualising initial algebras

Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules

Mathematical Structures in Computer Science
de Bruijn notation as a nested datatype

Journal of Functional Programming
A unified category theoretic approach to variable binding

MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Explicit substitutions and higher-order syntax

MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Generalized iteration and coiteration for higher-order nested datatypes

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

Rewriting via coinserters

Nordic Journal of Computing
Explicit substitutions and higher-order syntax

Higher-Order and Symbolic Computation
Modules over monads and initial semantics

Information and Computation
Modules over monads and linearity

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Semantics of higher-order recursion schemes

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Adjoint folds and unfolds: or: scything through the thicket of morphisms

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Towards Effects in Mathematical Operational Semantics

Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying structured recursion schemes

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Adjoint folds and unfolds-An extended study

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired from the recent developments in theories of non-wellfounded syntax (coinductively defined languages) and of syntax with binding operators, the structure of algebras of wellfounded and non-wellfounded terms is studied for a very general notion of signature permitting both simple variable binding operators as well as operators of explicit substitution. This is done in an extensional mathematical setting of initial algebras and final coalgebras of endofunctors on a functor category. The main technical tool is a novel concept of heterogeneous substitution systems.