Download Fichier PDF

243
Stavridou, V. (1988). Specifying in OBJ, verifying in REVE and some ideas about time, Technical
Report CSD-TR-605, Department of Computer Science, RHBNC, University of London. To
appear in “Experiments with the OBJ Executable Specification Language”, D. Coleman,
R. M. Gallimore, J. A. Goguen eds.
Strandh, R. I. (1988). Compiling Equational Programs into Efficient Machine Code, PhD thesis,
The Johns Hopkins University, Baltimore, MD.
Strandh, R. I. (1989). Classes of equational programs that compile into efficient machine code,
in N. Dershowitz (ed.), Proceedings of the Third International Conference on Rewriting
Techniques and Applications, Chapel Hill, NC, pp. 449–461. Vol. 355 of Lecture Notes in
Computer Science, Springer, Berlin.
Turing, A. (1936). On computable numbers, with an application to the entscheidungsproblem,
Proceedings of the London Mathematical Society, Vol. 42, pp. 230–265.
van den Brand, M. G. J., de Jong, H. A. et Olivier, P. (1998). Efficient annotated terms,
Technical report, University of Amsterdam. In preparation.
van den Brand, M. G. J., Heering, J. et Klint, P. (1997). Renovation of the Old ASF MetaEnvironment – Current State of Affairs, Proceedings of International Workshop on Theory
and Practice of Algebraic Specifications ASF+SDF 97, Amsterdam (The Nederlands), Workshops in Computing, Springer-Verlag.
van den Brand, M. G. J., Klint, P. et Olivier, P. (1999). Compilation and Memory Management for ASF+SDF, Compiler Construction, Lecture Notes in Computer Science, SpringerVerlag.
van den Brand, M. G. J., Olivier, P., Moonen, L. et Kuipers, T. (1997). Implementation of
a Prototype for the New ASF Meta-environment, Proceedings of International Workshop
on Theory and Practice of Algebraic Specifications ASF+SDF 97, Amsterdam (The Nederlands), Workshops in Computing, Springer-Verlag.
Vigneron, L. (1998). Automated Deduction Techniques for Studying Rough Algebras, Fundamenta Informaticae 33(1): 85–103.
Visser, E. (1997). Syntax Definition for Language Prototyping, PhD thesis, UVA, Amsterdam,
NL.
Vittek, M. (1994). ELAN: Un cadre logique pour le prototypage de langages de programmation
avec contraintes, Thèse de Doctorat d’Université, Université Henri Poincaré – Nancy 1.
Vittek, M. (1996). A compiler for nondeterministic term rewriting systems, in H. Ganzinger
(ed.), Proceedings of RTA’96, Vol. 1103 of Lecture Notes in Computer Science, SpringerVerlag, New Brunswick (New Jersey), pp. 154–168.
Wampler, S. et Griswold, R. (1983). The implementation of generators and Goal-Directed
Evaluation in Icon, Software-Practice and Experience 13: 495–518.
Warren, D. H. D. (1983). An abstract Prolog instruction set, Technical Report 309, SRI International, Artificial Intelligence Center.
Weis, P. et Leroy, X. (1993). Le langage Caml, Ediscience. ISBN 2-7296-0493-6.
Wilhelm, R. et Maurer, D. (1994). Les compilateurs, Masson. ISBN 2-225-84615-4.
Wilson, P. R. (1992). Uniprocessor garbage collection technique, International Workshop on
Memory Management, Vol. 637 of Lecture Notes in Computer Science, Springer-Verlag,
Saint Malo, pp. 1–42.
Wirsing, M. (1995). Algebraic specification languages: An overview, Recent Trends in Data Types
Specification, Vol. 906 of Lecture Notes in Computer Science, Springer-Verlag, pp. 81–115.