Towards a sketch based model of self-interpreters

Reeves, A. C.

Reeves, A. C.

Diagrammes, Tome 33 (1995), p. i-ix,1-178

MR Zbl

@article{DIA_1995__33__R1_0,
     author = {Reeves, A. C.},
     title = {Towards a sketch based model of self-interpreters},
     journal = {Diagrammes},
     pages = {i-ix,1-178},
     year = {1995},
     publisher = {Universit\'e Paris 7, Unit\'e d'enseignement et de recherche de math\'ematiques},
     volume = {33},
     mrnumber = {1447830},
     zbl = {0896.68094},
     language = {en},
     url = {https://www.numdam.org/item/DIA_1995__33__R1_0/}
}

TY  - JOUR
AU  - Reeves, A. C.
TI  - Towards a sketch based model of self-interpreters
JO  - Diagrammes
PY  - 1995
SP  - i
EP  - ix,1
VL  - 33
PB  - Université Paris 7, Unité d'enseignement et de recherche de mathématiques
UR  - https://www.numdam.org/item/DIA_1995__33__R1_0/
LA  - en
ID  - DIA_1995__33__R1_0
ER  -

%0 Journal Article
%A Reeves, A. C.
%T Towards a sketch based model of self-interpreters
%J Diagrammes
%D 1995
%P i-ix,1-178
%V 33
%I Université Paris 7, Unité d'enseignement et de recherche de mathématiques
%U https://www.numdam.org/item/DIA_1995__33__R1_0/
%G en
%F DIA_1995__33__R1_0

Reeves, A. C. Towards a sketch based model of self-interpreters. Diagrammes, Tome 33 (1995), p. i-ix,1-178. https://www.numdam.org/item/DIA_1995__33__R1_0/

Bibliographie
Cité par

[Back78] Backus J.; Can programming be liberated from the von Neuman Style? A functional style and its algebra of progmms, Communications of the A.C.M., Vol 20, No 8, 1978, pp 613-641. | Zbl | MR

[Barr86] Barr M.; Models of sketches, Cahiers de Topologie Géomértie Différentielle Catégorique 27, 1986, pp 93-107. | Zbl | MR | Numdam

[BaWe85] Barr M., Wells C.; Toposes, triples and theories, Springer-Verlag, 1985. | Zbl | MR

[BaWe90] Barr M., Wells C.; Category theory for Computing science, Prentice Hall International Series in Computer Science, Ed C. A. R. Hoare, 1990. | Zbl | MR

[BaEh68] Bastiani A., Ehresmann C. ; Categories of sketched structures, Cahiers de Topologie Géomértie Différentielle 10, pp 104-213, 1968.

[BHOS76] Beckman L., Haraldson A., Oskarsson, Ö., Sandewall E.; A partial evaluator, and its use as a programming tool, Artificial Intelligence, Vol 7, No 4, pp 319-357, 1976. | Zbl

[BJEJ88] Bjørner D., Ershov A.P., Jones N.D. (Eds); Partial evaluation and mixed computation, Proceedings IFIP TC2 Workshop, Gammel Avernæs, Denmark, October 1987, North-Holland, 1988. | Zbl

[Boch78] Bochmann G. V.; Compiler writing system for attribute grammars, Computing Journal Vol 21, No 2, pp 144-148, 1978. | Zbl

[Bond88] Bondorf A.; Pattern matching in a self-applicable partial evaluator, Unpublished draft, DIKU, University of Copenhagen, 1988.

[Bond90a] Bondorf A.; Automatic autoprojection of higher order recursive equations, ES0P '90, Copenhagen, Denmark, LNCS 432, pp 70-87, Jones (Ed), Springer-Verlag. | Zbl

[Bond90b] Bondorf A.; Compiling laziness by partial evaluation, Functional Programming: Proceedings of the 1990 Glasgow Workshop, pp 11-21. 13-15th August 1990, Ullapool, Scotland, Peyton Jones S.L., Hutton G., Holst C.K. (Eds.), Springer Workshops in Computing, Springer-Verlag.

[BoDa80] Borceaux F., Day B.; Universal algebra in closed categories, Journal of pure and applied algebra 16, 1980, pp 133-147. | Zbl | MR

[Boul80] Boullier P.; Generation automatique d'analysers syntaxiques avec rattrapage d'errors, Journees Francophone sur la Production Assistée de Logiciel, Geneva, 1980.

[Burr70] Burroni A.; Esquisse des catégories à limites et des quasi-topologies, Esquisse Math. 5, 1970. | Zbl | MR

[BuLa69] Burstall R. M., Landin P. J.; Programs and their proofs: an algebraic approach, Machine Intelligence 4, 1969. | Zbl | MR

[Coll86] Collier P. D.; Simple compiler correctness - a tutorial on the algebraic approach, The Australian Computer Journal, Vol 18, No 3, pp l28-135, 1986. | Zbl

[Cons90] Consel C.; Binding time analysis for higher order untyped functional languages, ACM Conference on Lisp and Functional Languages, Nice, France, pp 264-272, June 1990.

[Copp80] Coppey L.; Quelques problemes typiques concernant les graphes multiplicatifs, Diagrammes, Vol 3, pp C1-C46. | Zbl | MR | Numdam | EuDML

[CoLa84] Coppey C., Lair C.; Leçons de théorie des esquisses (I), Diagrammes, Vol 12, 1984. | Zbl | MR | Numdam | EuDML

[CoLa85] Coppey C., Lair C.; Algébricité, monadicité, esquissabilité et non algébricité, Diagrammes 13, 1985. | Zbl | MR | Numdam | EuDML

[Desc82] Deschamp Ph.; PERLUETTE: a compiler producing system using abstract data types, Proceedings of International Symposium on Programming, Turin, April 1982. | Zbl | MR

[DuRa91] Duval D., Raynaud J-C.; Sketches and computation, Rapport De Recherche RR 871I-IMAG-123 LIFIA, LIFIA-IMAG, Institut National Polytechnique de Grenoble, 1991.

[Ehre67] Ehresmann C.; Sur les structures algébriques, CRAS, tome 264, pp 840-843, 1967. | Zbl | MR

[Ehre68] Ehresmann C. Esquisses et types de structures algébriques, Bull. Instit. Polit. XIV, pp 1-14, 1968. | Zbl | MR

[Ersh77] Ershov A.P.; On the partial computation principle, Information processing letters, Vol 6, No 2, 1977, pp 38-41. | Zbl

[Ersh82] Ershov A.P.; Mixed computation: potential applications and problems for study, Theoretical computer science, Vol 18, No 1, 1982, pp 41-67. | Zbl | MR

[Folt69] Foltz F.; Sur la catégorie des foncteurs dominés, Cahiers de Topologie Géomértie Diff-érentielle 9, 2, 1969 | Zbl | MR | Numdam | EuDML

[Futa71] Futamura Y.; Partial evaluation of computation process - an approach to a compiler-compiler, Systems, Computers, Controls, Vol 2, No 5, 1971, pp 45-50.

[Futa82] Futamura Y.; Partial computation of programs, Proc: RIMS Symposia on software science and engineering, Kyoto 1982, LNCS 147, pp 1-34, Springer-Verlag. | Zbl

[Ganz79] Ganzinger H.; Some principles for the development of compiler descriptions from denotational language definitions, Technical University of Munich, Technical Report, 1979.

[Gold84] Goldblatt R.; Topoi, the categorical analysis of logic, Revised edition, Studies in logic and the foundations of mathematies, Vol 98, Eds: J. Barwise, D. Kaplan, H.J. Keisler, P. Suppes, A.S. Troelstra, 1984, North-Holland. | Zbl | MR

[Goma89] Gomard C.K.; Higher order partial evaluation - HOPE for the lambda calculus, Masters Thesis, DIKU, Department of Computer Science, University of Copenhagen, 1989.

[Gray87] Gray J.W.; Categorical aspects of data type constructors, Theoretical computer science, Vol 50, No 2, 1987, pp 103-135. | Zbl | MR

[Gray?] Gray J.W.; Executable specifications for data-type constructors, in preparation.

[GuLa80] Guitart R., Lair C.; Calcul syntaxique des modèles et calcul des formules internes, Diagrammes 4, ( 1980). | Zbl | MR | Numdam | EuDML

[HaRu76] Hatcher W. S., Rus T.; Context-free algebras, Journal of Cybernetics 6:2-3, 1976, pp 65-77. | Zbl | MR

[Higg63] Higgins P. J.; Algebra with a scheme of operations, Mathematische Nachrichten 27, 1963/64, pp 115-132. | Zbl | MR

[HoHu90] Holst C.K., Hughes J.; Towards a binding-time analysis improvement for free, Functional Programming: Proceedings of the 1990 Glasgow Workshop, pp 11-21, 13-15th August 1990, Ullapool, Scotland, Peyton Jones S.L., Hutton G., Holst C.K. (Eds,), Springer Workshops in Computing, Springer-Verlag.

[John78] Johnson S.C.; Yacc: Yet another compiler compiler, in the UNIX programmer's manual, Vol 2B, 1978.

[Jone88] Jones N.D.; Automatic program specialization: A re-examination from basic principles, In [BjEJ88], pp 225-282, 1988.

[JoSc80] Jones N.D., Schmidt D.A.; Compiler generation from denotational semantics, Semantics Directed Compiler Generation, Proceedings of a workshop Aarhus, January 1980, LNCS 94, pp 70-93, Springer-Verlag.

[JoSS85] Jones N.D., Sestoft P., Søndergaard H.; An experiment in partial evaluation: the generation of a compiler generator, Rewriting techniques and applications, J.P. Jouannaud (Ed), 1985, LNCS 202, pp 124-140, Springer-Verlag.

[JoSS87] Jones N.D., Sestoft P., Søndergaard H.; Mix: A self-applicable partial evaluator for experiments in compiler generation, Mathematical foundations of programming language semantics, Proceedings: 3rd workshop, Tulane University, New Orleans, Louisiana, 1987, LNCS 298, pp 386-413, Springer-Verlag. | Zbl

[JoSS89] Jones N.D., Sestoft P., Søndergaard H.; Mix: A self-applicable partial evaluator for experiments in compiler generation, Lisp and Symbolic Computation, Vol 2, No 1, 1989.

[Jorg90] Jørgensen J.; Generating a pattern matching compiler by partial evaluation, Functional Programming: Proceedings of the 1990 Glasgow Workshop, pp 11-21, 13-15th August 1990, Ullapool, Scotland, Peyton Jones S.L., Hutton G., Holst C.K. (Eds.), Springer Workshops in Computing, Springer-Verlag.

[KoQu92] Kortas S., Quatrain R.; Modélisation de la syntaxe et la sémantique d'un language informatique par les esquisses, Rapport du Séminaire d'Initiation a la Recherche (1991/1992), Ecols Centrale de Paris, Laboratoire de Mathématiques Appliquées, Multigraphie, Paris 1992.

[Lair75] Lair C.; Etude générale de la Catégorie des esquisses, Esquisses Mathematiques 23, pp 1-62, 1975. | Zbl | MR

[Lair87] Lair C.; Categorrie qualifiables et catégories esquissables, Diagrammes 17, 1987. | Zbl | MR | Numdam | EuDML

[Lair87b] Lair C.; Trames et sémantiques catégoriques des systèmes trames, Diagrammes 18, 1987. | Zbl | MR | Numdam | EuDML

[Laun88] Launchbury J.; Projections for specialisation, University of Glasgow Department of Computing Science, Technical Report 88/R8, 1988.

[Laun89] Launchbury J.; Dependent sums express separation of binding times, Functional Programming: Proceedings of the 1989 Glasgow Workshop, pp 238-253, 21-23 August 1989, Fraserburgh, Scotland, Davis K, Hughes J (Eds), Springer Workshops in Computing, Springer-Verlag.

[Laun90] Launchbury J.; Projection factorisations in partial evaluation, Ph.D. Thesis, Department of Computing Science, University of Glasgow, CSC 90/R2, 1990. | Zbl | MR

[Lorh82] Lorho B.; The system DELTA and its derivatives, Tools and Notions for Program Construction, D. Neel (Ed), Cambridge University Press, pp 306-317, 1982.

[Macl71] Mac Lane S.; Categories for the working mathematician, 1971, Springer-Verlag. | Zbl

[MaBe85] Mazaher S., Berry D.M.; Deriving a compiler from an operational semantics written in V.D.L., Computer Languages, Vol 10, No 2, pp 147-164, 1985. | Zbl

[Morr73] Morris F.L.; Advice on structuring compilers and proving them correct, Proceedings ACM Symposium on Principles of Programming Languages, Boston, 1973, pp 144-152. | Zbl

[Moss76] Mosses P.D.; Compiler generation using denotational semantics, Mathematical foundations of Computer Science, 1976, LNCS 45, pp 463-441, Springer-Verlag. | Zbl

[Moss79] Mosses P.D.; A constructive approach to compiler correetness, DAIMI IR-16, University of Aarhus, 1979. | MR

[RaTu79] Raskovsky M., Turner R.; Compiler generation and denotational semantics, Fundamentals of Computation Theory, 1979. | Zbl

[Reev87] Reeves A.C.; An algebraic directed compiler generator using denotational semantics, University of Stirling Department of Computing Science, Honours Project, May 1987.

[ReRa89] Reeves A.C., Rattray C.; Sketching a constructive definition of 'mix', Functional Programming: Proceedings of the 1989 Glasgow Workshop, pp 118-132, 21-23 August 1989, Fraserburgh, Scotland, Davis K, Hughes J (Eds), Springer Workshops in Computing, Springer-Verlag.

[Roye86] Royer V.; Transformations of denotational semantics in semantics directed compiler generation, Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, Palo Alto, USA, In: SIGPLAN Notices (USA), Vol 12, No 7, pp 68-73, 1986.

[Rus76] Rus T.; Context-free algebra: a mathematical device for compiler specification, Mathematical foundations of Computer Science, 1976, LNCS 45, pp 488-494, Springer-Verlag. | Zbl

[Rus83] Rus T.; T.I.C.S. System: a compiler generator, University of Iowa Department of Computer Science technical report 83-08, 1983.

[RuHe84] Rus T., Herr F.B.; An algebraic directed compiler generator, University of Iowa Department of Computer Science, Technical Report 84-02, 1984.

[Rus85] Rus T.; An inductive approach for program evaluation, University of Iowa Department of Computer Science, Technical Report 85-02, 1985.

[Rus86] Rus T.; An alternative to C.F. grammar for language specification, Proceedings of IEEE conference on computer languages, Oct 27-30, 1986, Miami beach, Florida.

[Rus87] Rus T.; An algebraic model for programming languages, Computer Languages, Vol 12, No 3/4, pp173-195, 1987. | Zbl

[Rus90] Rus T.; Algebraic construction of a compiler, University of Iowa Department of Computing Science, Technical Report 90-01, 1990. | MR

[Rus92] Rus T.; Algebraic construction of compilers, The Unified Computation Laboratory, Rattray C.M.I. Clark R.G. (Eds), The Institute of Mathematics and its Applications, Oxford University Press, 1992. | MR

[RyBu88] Rydeheard D.E., Burstall R.M.; Computational category theory, Prentice Hall international series in computer science, Ed: C.A.R. Hoare, 1988. | Zbl | MR

[ScSt71] Scott D.S., Strachey C.; Toward a mathematical semantics for computer languages, Oxford University Computing Laboratory, Programming Research Group, Technical Monograph PRG-6, 1971. | Zbl

[Sest85] Sestoft P.; The structure of a self-applicable partial evaluator, Programs as data objects, Proceedings of a workshop, Denmark, 1985, LNCS 217, pp 236-256, Springer-Verlag. | Zbl

[Stoy77] Stoy J.E.; Denotational semantics, MIT press, Cambridge, Mass., 1977. | Zbl | MR

[Schm85] Schmidt D.A.; An implementation from a direct semantics definition, Programs as data objects, Proceedings of a workshop, Denmark, 1985, LNCS 217, pp 222-235, Springer-Verlag. | Zbl

[Schm86] Schmidt D.A.; Denotational semantics - A methodology for language development, Allyn and Bacon, 1986.

[ThWW80] Thatcher J.W., Wagner E.G., Wright J.B.; More advice on structuring compilers and proving them correct, Semantics Directed Compiler Generation, Proceedings of a workshop Aarhus, January 1980, LNCS 94, pp 165-188, Springer-Verlag. | MR

[Turc80] Turchin V.F.; Semantic definitions in REFAL and automatic production of compilers, Semantics Directed Compiler Generation, Proceedings of a workshop Aarhus, January 1980, LNCS 94, pp 441-474, Springer-Verlag.

[TuNT82] Turchin V.F., Nirenberg R.M., Turchin D.V.; Experiments with a supercompiler, ACM Symposium on Lisp and Functional Programming, Pittsburgh Pennsylvania, pp 47-55, 1982.

[Turc85] Turchin V.F.; Program transformation by supercompilation. Programs as data objects, Proceedings of a workshop, Denmark, 1985, LNCS 217, pp 257-281, Springer-Verlag. | Zbl

[Turc86] Turchin V.F.; The concept of a supercompiler, ACM-TOPLAS, Vol 8, No 3, 1986, pp 292-325. | Zbl

[Vick86] Vickers T.N.; Quokka: A translator generator using denotational semantics, The Australian Computer Journal, Vol 18, No 1, pp 9-17, 1986.

[Wadl89] Wadler P.; Theorems for free!, Proceedings FPCA' 89, Fourth International Conference on Functional Programming Languages and Computer Architecture, London, September 1989, pp 347-359, Addison Wesley.

[Wait70] Waite W. M.; The mobile programming system: STAGE2, Communications of the A.C.M., Vol 13, No 7, pp 415-421, 1970. | Zbl

[Wand80] Wand M.; Different advice on structuring compilers and proving them correct, Indiana University Department of Computer Science, Technical Report No 95, 1980.

[Wand85] Wand M.; From interpreter to compiler: a representational derivation, Programs as data objects, Proceedings of a workshop, Denmark, 1985, LNCS 217, pp 306-324, Springer-Verlag. | Zbl

[WeBa87] Wells C., Barr M.; The formal description of data types using sketches, Mathematical foundations of programming language semantics, Proceedings: 3rd workshop, Tulane University, New Orleans, Louisiana, 1987, LNCS 298, pp 386-413, Springer-Verlag. | Zbl

[Well90] Wells C.; A generalisation of the concept of sketch. Theoretical Computer Science, Vol 20, No 1, 1990, pp 159-178. | Zbl | MR

[Yuso91] Yusop N.I.; Generating executable sketches in prolog, MSc IT dissertation, Department of Computing Science, University of Stirling, 1991.