Ralph Matthes, Tarmo Uustalu  Home/Search
Context Related
| tcs.informatik.uni...esuustalucmcs03.ps cs.ioc.ee/~tarmo/papers/cmcs03.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcs.informatik.unimuench...works (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. In... (Update)
Cited by: More
Generalizing Substitution - Uustalu (2003) (Correct)
Coproducts Of Ideal Monads - Ghani, Uustalu (Correct)
Explicit Substitutions and Higher-Order Syntax (Extended Abstract) - Ghani (2003) (Correct)
Active bibliography (related documents): More All
0.7: Fixed Points of Type Constructors and Primitive Recursion - Abel, Matthes (Correct)
0.5: A Definitional Approach to Primitive Recursion over.. - Ambler, Crole.. (2003) (Correct)
0.4: Generalized Iteration and Coiteration for Higher-Order.. - Abel, Matthes, Uustalu (2003) (Correct)
Similar documents based on text: More All
0.6: On the Foundations of Corecursion - Moss, DANNER (1997) (Correct)
0.6: Functional Programming with Apomorphisms (Corecursion) - Vene, Uustalu (1998) (Correct)
0.5: Monotone Inductive and Coinductive Constructors of Rank 2 - Matthes (2001) (Correct)
Related documents from co-citation: More All
3: Infinite trees and completely iterative theories: a coalgebraic view (context) - Aczel, Adamek et al. - 2003
3: Free iterative theories: a coalgebraic view (context) - Adamek, Milius et al. - 2001
3: Dualising initial algebras (context) - Ghani, Luth et al. - 2003
BibTeX entry: (Update)
R. Matthes and T. Uustalu. Substitution in non-wellfounded syntax with variable binding. In H. P. Gumm, ed., Proc. of 6th Int. Wksh. on Coalg. Methods in Comp. Sci., CMCS'03, v. 82(4) of Electr. Notes in Theor. Comp. Sci. Elsevier, 2003. http://citeseer.ist.psu.edu/matthes03substitution.html More
@misc{ matthes03substitution,
author = "R. Matthes and T. Uustalu",
title = "Substitution in non-wellfounded syntax with variable binding",
text = "R. Matthes and T. Uustalu. Substitution in non-wellfounded syntax with
variable binding. In H. P. Gumm, ed., Proc. of 6th Int. Wksh. on Coalg.
Methods in Comp. Sci., CMCS'03, v. 82(4) of Electr. Notes in Theor. Comp.
Sci. Elsevier, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/matthes03substitution.html" }
Citations (may not include all citations):106 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
69 Abstract syntax and variable binding (context) - Fiore, Plotkin et al.
59 Semantical analysis of higher-order abstract syntax (context) - Hofmann
45 Nested datatypes - Bird, Meertens
27 A framework for de ning logics (context) - Harper, Honsell et al. - 1993
25 truth and set (context) - Aczel
25 Generalised folds for nested datatypes - Bird, Paterson - 1999
23 De Bruijn notation as a nested datatype - Bird, Paterson - 1999
16 Monadic presentations of lambda terms using generalized indu.. - Altenkirch, Reus
13 Locus solum: From the rules of logic to the logic of rules (context) - Girard - 2001
13 Polytypic functions over nested datatypes - Hinze - 1999
8 Monotone inductive and coinductive constructors of rank - Matthes
7 Substitution: A formal methods case study using monads and t.. - Bellegarde, Hook - 1994
6 iteration for higher-order nested datatypes (context) - Abel, Matthes - 2002
5 monads and comonads (context) - Ghani, uth et al.
5 Coequalizers and free triples (context) - Barr - 1970
4 Coalgebraic monads - Ghani, uth et al.
3 On continuous normalization - Aehlig, Joachimski
3 A coalgebraic view of in nite trees and iteration (context) - Aczel, Ad et al.
2 Generalized iteration and coiteration for higher-order neste.. - Abel, Matthes et al. - 2003
2 Basic category theory for models of syntax - Crole - 2002
2 on Algebraic and Coalgebra (context) - Aczel, Algebras et al.
1 Finite investigations of in nite derivations (context) - Mints
1 Sleep and F (context) - Kennaway, Klop - 1997
Documents on the same site (http://www.tcs.informatik.uni-muenchen.de/~matthes/works.html): More
Characterizing Strongly Normalizing Terms for a Lambda Calculus.. - Matthes (2000) (Correct)
Standardization and Confluence for a Lambda Calculus with.. - Joachimski, Matthes (2000) (Correct)
Lambda Calculus: A Case for Inductive Definitions - Matthes (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC