Book contents
- Frontmatter
- Contents
- List of contributors
- Preface
- 1 Determinacy in a synchronous π-calculus
- 2 Classical coordination mechanisms in the chemical model
- 3 Sequential algorithms as bistable maps
- 4 The semantics of dataflow with firing
- 5 Kahn networks at the dawn of functional programming
- 6 A simple type-theoretic language: Mini-TT
- 7 Program semantics and infinite regular terms
- 8 Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations
- 9 Generalized finite developments
- 10 Semantics of program representation graphs
- 11 From Centaur to the Meta-Environment: a tribute to a great meta-technologist
- 12 Towards a theory of document structure
- 13 Grammars as software libraries
- 14 The Leordo computation system
- 15 Theorem-proving support in programming language semantics
- 16 Nominal verification of algorithm W
- 17 A constructive denotational semantics for Kahn networks in Coq
- 18 Asclepios: a research project team at INRIA for the analysis and simulation of biomedical images
- 19 Proxy caching in split TCP: dynamics, stability and tail asymptotics
- 20 Two-by-two static, evolutionary, and dynamic games
- 21 Reversal strategies for adjoint algorithms
- 22 Reflections on INRIA and the role of Gilles Kahn
- 23 Can a systems biologist fix a Tamagotchi?
- 24 Computational science: a new frontier for computing
- 25 The descendants of Centaur: a personal view on Gilles Kahn's work
- 26 The tower of informatic models
- References
9 - Generalized finite developments
Published online by Cambridge University Press: 06 August 2010
Book contents
- Frontmatter
- Contents
- List of contributors
- Preface
- 1 Determinacy in a synchronous π-calculus
- 2 Classical coordination mechanisms in the chemical model
- 3 Sequential algorithms as bistable maps
- 4 The semantics of dataflow with firing
- 5 Kahn networks at the dawn of functional programming
- 6 A simple type-theoretic language: Mini-TT
- 7 Program semantics and infinite regular terms
- 8 Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations
- 9 Generalized finite developments
- 10 Semantics of program representation graphs
- 11 From Centaur to the Meta-Environment: a tribute to a great meta-technologist
- 12 Towards a theory of document structure
- 13 Grammars as software libraries
- 14 The Leordo computation system
- 15 Theorem-proving support in programming language semantics
- 16 Nominal verification of algorithm W
- 17 A constructive denotational semantics for Kahn networks in Coq
- 18 Asclepios: a research project team at INRIA for the analysis and simulation of biomedical images
- 19 Proxy caching in split TCP: dynamics, stability and tail asymptotics
- 20 Two-by-two static, evolutionary, and dynamic games
- 21 Reversal strategies for adjoint algorithms
- 22 Reflections on INRIA and the role of Gilles Kahn
- 23 Can a systems biologist fix a Tamagotchi?
- 24 Computational science: a new frontier for computing
- 25 The descendants of Centaur: a personal view on Gilles Kahn's work
- 26 The tower of informatic models
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- From Semantics to Computer ScienceEssays in Honour of Gilles Kahn, pp. 185 - 204Publisher: Cambridge University PressPrint publication year: 2009
References
[2]. Handbook of Mathematical Logic, chapter the type free lambda calculus. In North-Holland, 1977.Google Scholar
[4] and . Minimal and optimal computations of recursive programs. JACM, 26(1):148–175, January 1979.Google Scholar
[5]. Computational semantics of term rewriting systems. In Algebraic methods in Semantics. Cambridge University Press, 1985.Google Scholar
[6]. The Calculi of Lambda-Conversion. Princeton University Press – Oxford University Press, 1941.Google Scholar
[11] and . Computations in orthogonal rewriting systems I and II, In Computational Logic; Essays in Honor of Alan Robinson. pp. 395–443. The MIT Press, 1991.Google Scholar
[12]. Combinatory Reduction Systems. PhD thesis. Mathematical Centre Tracts 127, CWI, Amsterdam, 1980.Google Scholar
[13]. A correspondence between Algol 60 and Church's lambda-notation. CACM, 8(2):89–101, 1965.Google Scholar
[14]. Distributive evaluations of lambda-calculus. Fundamenta Informaticae, 20(4):333–352, 1994.Google Scholar
[15]. An algebraic interpretation of the λβ-calculus and a labeled λ-calculus. In (ed.), Lambda-Calculus and Computer Science Theory, volume 37 of Lecture Notes in Computer Science, pp. 147–165. Springer, March 1975.Google Scholar
[16]. Réductions correctes et optimales dans le lambda calcul. PhD thesis, University of Paris 7, 1978. (in French).
[17]. Optimal reductions in the lambda-calculus. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 159–191. Academic Press, 1980.Google Scholar
[18]. La stratégie paresseuse. PhD thesis, University of Paris 7, July 1992.
[19]. A factorisation theorem in rewriting theory. In Proceedings of the 7th Conference on Category Theory and Computer Science, volume 1290, Lecture Notes in Computer Science, pp. 49–68, Santa Margherita Ligure. Springer, 1997.Google Scholar
[20], and . Selected Papers on Automath, volume 133, Studies in Logic and the Foundations of Mathematics. North-Holland, 1994.Google Scholar
[21] and . Equivalence of reductions. In Terese, Term Rewriting Systems. Cambridge University Press, March 2003.Google Scholar
[22]. Call-by-name, call-by-value, and the lambda-calculus. Theoretical Computer Science, 1, 1975.Google Scholar
[23]. The Language Theory of Automath. PhD thesis, TUE, 1980.
[24]. Finite family developments. In Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA '97), volume 1232, in Lecture Notes in Computer Science, pp. 308–322, Sitges, June 1997.Google Scholar
[25] and . Four equivalent equivalences of reductions. In WRS'02, volume 70(6), ENTCS, December 2002.Google Scholar
[26]. Event structure semantics for ccs and related languages. Technical report, DAIMI – AARhus University, April 1983.
- 1
- Cited by