TY - GEN
T1 - Multiparadigm logic programming
AU - Meseguer, José
N1 - Funding Information:
Besides, although perhaps not yet fully recognized, there is a very practical additional reason why programming in logic can have important advantages over programming in conventionM languages, namely the increasing importance of parallel computation. Conventional languages are an outgrowth of the Von Neumann sequential model of computation and it is therefore no surprise that they run well on sequential machines. In a parallel context, however, languages based on logic can greatly facilitate the programming task * Supported by Office of Naval Research Contracts N00014-90-C-0086 and N00014--88-C-0618, and by the Information Technology Promotion Agency, Japan, as a part of the R & D of Basic Technology for Future Industries "New Models for Software Architecture" sponsored by NEDO (New Energy and Industrial Technology Development Organization).
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.
PY - 1992
Y1 - 1992
N2 - A theory of general logics is outlined as a basis for an axiomatic notion of “logic programming language.” It is shown that a wide variety of logical programming languages are instances of the general notion. The problem of designing multiparadigm logic programming languages that overcome the present limitations faced by relational and functional logical languages in dealing with state change and reactive systems is approached by a method based on the use of the axiomatic notion of logic programming language and of mappings between logics to guide the search for a logic in which the desired multiparadigm integration can be attained. Following this method, rewriting logic is proposed as a logic in which the functional, relational, and concurrent object-oriented paradigms can be unified in a simple and rigorous way. Two languages based on this logic, Mande and MaudeLog, are briefly described and illustrated with examples.
AB - A theory of general logics is outlined as a basis for an axiomatic notion of “logic programming language.” It is shown that a wide variety of logical programming languages are instances of the general notion. The problem of designing multiparadigm logic programming languages that overcome the present limitations faced by relational and functional logical languages in dealing with state change and reactive systems is approached by a method based on the use of the axiomatic notion of logic programming language and of mappings between logics to guide the search for a logic in which the desired multiparadigm integration can be attained. Following this method, rewriting logic is proposed as a logic in which the functional, relational, and concurrent object-oriented paradigms can be unified in a simple and rigorous way. Two languages based on this logic, Mande and MaudeLog, are briefly described and illustrated with examples.
UR - http://www.scopus.com/inward/record.url?scp=0009948701&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0009948701&partnerID=8YFLogxK
U2 - 10.1007/bfb0013826
DO - 10.1007/bfb0013826
M3 - Conference contribution
AN - SCOPUS:0009948701
SN - 9783540558736
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 158
EP - 200
BT - Algebraic and Logic Programming - 3rd International Conference, Proceedings
A2 - Kirchner, Helene
A2 - Levi, Giorgio
PB - Springer
T2 - 3rd International Conference on Algebraic and Logic Programming, 1992
Y2 - 2 September 1992 through 4 September 1992
ER -