GOFFIN: Higher-order functions meet concurrent constraints

Science of Computer Programming

Volumn 30, Issue 1-2, 1998, Pages 157-199

  Chakravarty, Manuel M T ^a   Guo, Yike ^b   Köhler, Martin ^b   Lock, Hendrik C R ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; FORMAL LOGIC; PARALLEL ALGORITHMS;

GOFFIN PROGRAMMING LANGUAGE; PARALLEL PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031622795     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(97)00010-5     Document Type: Article

References (36)

1. H. Aït-Kaci, P. Lincoln, R. Nasr, Le fun: logic, equations, and functions, Proc. 4th IEEE Internat. Symp. on Logic Programming, 1987.
2. P.B. Andrews, An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Academic Press, New York, 1986.
3. R. Bird, P. Wadler, Introduction to Functional Programming, Prentice-Hall, Englewood Cliffs, NJ, 1988.
4. S. Breitinger, R. Loogen, Y. Ortega-Mallén, Concurrency in functional and logic programming, in: Preliminary Proc. of the Fuji Workshop on Functional and Logic Programming, Japan Society of Software Science and Technology, World Scientific Publ., Singapore, 1995.
5. S. Breitinger, R. Loogen, Y. Ortega-Mallén, Towards a declarative language for parallel and concurrent programming, in: D.N. Turner (Ed.), Proc. of the Glasgow Workshop on Functional Programming, University of Glasgow, Springer, London, 1995.
6. N. Carriero, D. Gelernter, Coordination languages and their significance, Comm. ACM 35(2) (1992).
7. M.M.T. Chakravarty, Higher-order logic as a basis for abstract machines implementing functional logic languages, Internal report, Available at (URL:http://www.cs.tu-berlin.de/~chak/papers/ papers.html), 1995.
8. K.M. Chandy, S. Taylor, An Introduction to Parallel Programming, Jones and Bartlett Publishers, Boston, MA, 1992.
9. A. Church, A formulation of the simple theory of types, J. Symbolic Logic 5 (1940) 56-68.
10. J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D.W.N. Sharp, Q. Wu, Parallel programming using skeleton functions, in: PARLE, 1993.
11. J.T. Feo (Ed.), A Comparative Study of Parallel Programming Languages: The Salishan Problems, North-Holland, Amsterdam, 1992.
12. I. Foster, Designing and Building Parallel Programs, Addison-Wesley, Reading, MA, 1995 (URL:http://www.mcs.anl.gov/dbpp/text/book.html).
13. C.A. Gunter, Semantics of Programming Languages - Structures and Techniques, Foundations of Computer Science, MIT Press, Cambridge, MA, 1992.
14. Y. Guo, Definitional constraint programming, Ph.D. Thesis, Department of Computing, Imperial College London, 1994.
15. M. Hanus, The integration of functions into logic programming: from theory to practice, J. Logic Programming 19 & 20 (1994).
16. L. Henkin, Completeness in the theory of types, J. Symbolic Logic 15 (1950) 81-91.
17. P. Hudak et al., Haskell special issue, ACM SIGPLAN Notices 27 (5) (1992).
18. P. Hudak, L. Smith, Para-functional programming: A paradigm for programming multiprocessor systems, in: Principles of Programming Languages, ACM, New York, 1986.
19. J. Hughes, Why functional programming matters, Comput. J. 32 (1989) 98-107.
20. R. Jagadeesan, K. Pingali, Abstract semantics for a higher order functional language with logic variables, in: Conf. Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, New York, NY, 1992; Also appeared as TR91-1220, Cornell University.
21. S. Janson, AKL - A multiparadigm programming language based on a concurrent constraint framework, Ph.D. Thesis, Computing Science Department, Uppsala University, 1994.
22. P. Kelly, Functional Programming for Loosely-Coupled Multiprocessors, Pitman, London, 1989.
23. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
24. J.W. Lloyd, Combining functional and logic programming languages, Proc. 1994 Internat. Logic Programming Symp., MIT Press, Cambridge, MA, 1994.
25. R. Mayr, T. Nipkow, Higher-order rewrite systems and their confluence, Tech. Report 19433, Insitut für Informatik, TU München, 1994.
26. D. Miller, G. Nadathur, F. Pfenning, A. Scedrov, Uniform proofs as a foundation for logic pogramming, Ann. Pure Appl. Logic 51 (1991) 125-157.
27. R. Milner, The polyadic π-calculus: a tutorial, in: F.L. Bauer, W. Brauer, H. Schwichtenberg (Eds.), Logic and Algebra of Specification, Springer, Berlin, 1991, pp. 201-246.
28. J. Niehren, Functional computation as concurrent computation. Research Report RR-95-14, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D66123 Saarbrücken, Germany, 1995. A shorter version appeared in: Proc. POPL'96, ACM Press, New York.
29. R.S. Nikhil, Id (Version 90.0) reference manual, Techn. Report, MIT Laboratory for Computer Science, July 1990, CSG Memo 284-1.
30. S.L. Peyton-Jones, The Implementation of Functional Programming Languages, Series in Computer Science, Prentice-Hall, Englewood Cliffs, NJ, 1987.
31. V. Saraswat, P. Lincoln, Higher-order, linear, concurrent constraint programming, Manuscript, August 1992.
32. V. Saraswat, M. Rinard, P. Panangaden, The semantic foundations of concurrent constraint programming, in: Conf. Record of the 18th Ann. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1991.
33. V.A. Saraswat, Concurrent Constraint Programming, MIT Press, Cambridge, MA, 1993.
34. E. Shapiro, The family of concurrent logic programming languages, ACM Comput. Surveys 21 (3) (1989) 412-510.
35. G. Smolka, The Oz programming model, in: J. van Leeuwen (Ed.), Computer Science Today, Lecture Notes in Computer Science, Vol. 1000, Springer, Berlin, 1995, pp. 324-343.
36. D.A. Wolfram, The Clausal Theory of Types, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, 1993.