next up previous
Up: The mZ Calculus and Previous: 5. Conclusion

Bibliography

1
H. Boehm.
Space efficient conservative garbage collection.
In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, volume 28 of SIGPLAN Notices, pages 197-206, June 1993.

2
R. Büssow and W. Grieskamp.
A Modular Framework for the Integration of Heterogenous Notations and Tools.
In K. Araki, A. Galloway, and K. Taguchi, editors, Proc. of the 1st Intl. Conference on Integrated Formal Methods - IFM'99. Springer-Verlag, London, June 1999.

3
H. S. Goodman.
The Z-into-Haskell tool-kit: An illustrative case study.
In J. P. Bowen and M. G. Hinchey, editors, ZUM'95: The Z Formal Specification Notation, volume 967 of Lecture Notes in Computer Science, pages 374-388. Springer-Verlag, 1995.

4
W. Grieskamp.
ZAP User's Guide.
Technische Universität Berlin, Dec. 1998.
The ZETA System Documentation, URL: http://uebb.cs.tu-berlin.de/zeta.

5
M. Hanus.
The integration of functions into logic programming: From theory to practice.
Journal of Logic Programming, 19(20), 1994.

6
M. Hanus.
A unified computation model for declarative programming.
In Proc. of the 1997 Joint Conference on Declarative Programming, Grado (Italy), 1997.

7
M. Hanus.
Curry - an integrated functional logic language.
Technical report, Internet, 1999.
Language report version 0.5.

8
P. H. Hartel, M. Feeley, M. Alt, L. Augustsson, P. Baumann, M. Beemster, E. Chailloux, C. H. Flood, W. Grieskamp, J. H. G. van Groningen, K. Hammond, B. Hausman, M. Y. Ivory, R. E. Jones, J. Kamperman, P. Lee, X. Leroy, R. D. Lins, S. Loosemore, N. Röjemo, M. Serrano, J.-P. Talpin, J. Thackray, S. Thomas, P. Walters, P. Weis, and P. Wentworth.
Benchmarking implementations of functional languages with ``pseudoknot'', a Float-Intensive benchmark.
J. of Functional Programming, 6(4), 1996.

9
X. Jia.
An approach to animating Z specifications.
Internet: http://saturn.cs.depaul.edu/ fm/zans.html, 1996.

10
G. Kahn.
Natural semantics.
In Symposium on Theoretical Computer Science (STACS'97), volume 247 of Lecture Notes in Computer Science, 1987.

11
M. Mehl, R. Scheidhauer, and C. Schulte.
An Abstract Machine for Oz.
Research Report RR-95-08, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D66123 Saarbrücken, Germany, June 1995.
Also in: Proceedings of PLILP'95, Springer-Verlag, LNCS, Utrecht, The Netherlands.

12
K. Moon.
Implementation of Subset Logic Languages.
PhD thesis, State University of New York at New Buffalo, 1997.

13
O. Owe.
Partial logic reconsidered: A conservative approach.
Formal Aspects of Computing, 5:208-223, 1997.

14
W. Schulte and W. Grieskamp.
Generating Efficient Portable Code for a Strict Applicative Language.
In Phoenix Seminar and Workshop on Declarative Programming. Springer Verlag, Berlin, Heidelberg, New York, 1992.

15
G. Smolka.
A calculus for higher-order concurrent constraint programming with deep guards.
Research Report RR-94-03, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, Feb. 1994.

16
J. M. Spivey.
The Z Notation: A Reference Manual.
Prentice Hall International Series in Computer Science, 2nd edition, 1992.

17
F. Stolzenburg.
An algorithm for general set unification and its complexity.
Journal of Automated Reasoning, 22(1), 1999.

18
R. L. Vaught.
Set Theory - An Introduction.
Birkhäuser, 1995.

19
D. H. D. Warren.
The extended andorra model with implicit control.
In ICLP'90 Parallel Logic Programming Workshop, 1990.

20
M. M. West and B. M. Eaglestone.
Software development: Two approaches to animation of Z specifications using Prolog.
IEE/BCS Software Engineering Journal, 7(4):264-276, July 1992.

21
M. Winikoff, P. Dart, and E. Kazmierczak.
Rapid prototyping using formal specifications.
In Proceedings of the Australasian Computer Science Conference, 1998.



Wolfgang Grieskamp