Zena M. Ariola
Jan Willem Klop
1994
Cyclic Lambda Graph Rewriting
Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science
IEEE Computer Society Press
Paris, France
416–425
Christopher Kumar Anand
Wolfram Kahl
2008
Code Graph Transformations for Verifiable Generation of SIMD-Parallel Assembly Code
Andy Schürr
Manfred Nagl
Albert Zündorf
Applications of Graph Transformations with Industrial Relevance, AGTIVE 2007
LNCS
5088
217–232
10.1007/978-3-540-89020-1
Christopher K. Anand
Wolfram Kahl
2009
An Optimized Cell BE Special Function Library Generated by Coconut
IEEE Transactions on Computers
58
8
1126–1138
10.1109/TC.2008.223
Christopher K. Anand
Wolfram Kahl
2009
Synthesizing and Verifying Multicore Parallelism in Categories of Nested Code Graphs
Michael Alexander
William Gardner
Process Algebra for Parallel and Distributed Processing
1
CRC Computational Science Series
2
Chapman & Hall
3–45
Andrea Corradini
Fabio Gadducci
1999
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
Applied Categorical Structures
7
4
299–331
Andrea Corradini
Francesca Rossi
1993
Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
B. Courcelle
G. Rozenberg
Selected Papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Elsevier
7–48
10.1016/0304-3975(93)90063-Y
Theoretical Computer Science 109 (1–2)
Peter J. Freyd
Andre Scedrov
1990
Categories, Allegories
North-Holland Mathematical Library
39
North-Holland
Amsterdam
Carlos Gonzal\'ıa
2006
Relations in Dependent Type Theory
Ph.D. thesis
Department of Computer Science and Engineering, Chalmers University of Technology, Göteborg University
Technical Report No. 14D
Armando Haeberer
Marcelo Frias
Gabriel Baum
Paulo Veloso
1997
Fork Algebras
Chris Brink
Wolfram Kahl
Gunther Schmidt
Relational Methods in Computer Science
4
Advances in Computing Science
Springer
Wien, New York
54–69
Berthold Hoffmann
Detlef Plump
1991
Implementing Term Rewriting by Jungle Evaluation
Informatique théorique et applications/Theoretical Informatics and Applications
25
5
445–472
Gérard Huet
Amokrane Sa\"ıbi
1998
Constructive Category Theory
Proceedings of the Joint CLICS-TYPES Workshop on Categories and Type Theory, Goteborg
10.1.1.39.4193
Gérard Huet
Amokrane Sa\"ıbi
2000
Constructive Category Theory
Gordon D. Plotkin
Colin Stirling
Mads Tofte
Proof, language, and interaction: Essays in honour of Robin Milner
Foundations Of Computing Series
MIT Press
239–275
Wolfram Kahl
Christopher Kumar Anand
Jacques Carette
2006
Control-Flow Semantics for Assembly-Level Data-Flow Graphs
Wendy McCaull
Michael Winter
Ivo Düntsch
8th Intl.Seminar on Relational Methods in Computer Science, RelMiCS 8, Feb.2005
LNCS
3929
Springer
147–160
Akira Kanda
1981
Constructive Category Theory (No. 1)
Jozef Gruska
Michal Chytil
Mathematical Foundations of Computer Science, MFCS '81
LNCS
118
Springer
563–577
10.1007/3-540-10856-4_125
Saunders Mac Lane
1971
Categories for the Working Mathematician
Springer-Verlag
John Maraist
Martin Oderski
Philip Wadler
1998
The Call-by-Need Lambda Calculus
J.Functional Programming
8
3
275–317
Ulf Norell
2007
Towards a Practical Programming Language Based on Dependent Type Theory
Ph.D. thesis
Department of Computer Science and Engineering, Chalmers University of Technology
http://www.cs.chalmers.se/~ ulfn/papers/thesis.html
Nicolas Pouillard
François Pottier
2010
A fresh look at programming with names and binders
ICFP 2010, Intl.Conf.on Functional Programming
ACM
New York, NY, USA
217–228
10.1145/1863543.1863575
http://nicolaspouillard.fr/publis/pouillard-pottier-fresh-look-agda-2010/
David A. Turner
1982
Recursion Equations as a Programming Language
J. Darlington
Functional Programming and its Applications: An Advanced Course
Cambridge Univ.Press
1–27