Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Compiling Multi-Paradigm Declarative Programs into Sergio Antoy1
 

Summary: Compiling Multi-Paradigm Declarative Programs into
Prolog
Sergio Antoy1
Michael Hanus2
1
Department of Computer Science, Portland State University,
P.O. Box 751, Portland, OR 97207, U.S.A., antoy@cs.pdx.edu
2
Institut f¨ur Informatik, Christian-Albrechts-Universit¨at Kiel,
Olshausenstr. 40, D-24098 Kiel, Germany, mh@informatik.uni-kiel.de
c Springer-Verlag
In Proc. of the 3rd International Workshop on Frontiers of Combining Systems,
FroCoS 2000, Nancy.
Springer LNCS 1794, pp. 171­185, 2000
Abstract. This paper describes a high-level implementation of the concurrent
constraint functional logic language Curry. The implementation, directed by the
lazy pattern matching strategy of Curry, is obtained by transforming Curry pro-
grams into Prolog programs. Contrary to previous transformations of functional
logic programs into Prolog, our implementation includes new mechanisms for
both efficiently performing concurrent evaluation steps and sharing common sub-

  

Source: Antoy, Sergio - Department of Computer Science, Portland State University

 

Collections: Computer Technologies and Information Sciences