5 Functional and Constraint Logic Programming

[1]  Puri Arenas,et al.  A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types , 1997, TAPSOFT.

[2]  Sanjai Narain.  A Technique for Doing Lazy Evaluation in Logic , 1986, J. Log. Program..

[3]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[4]  Peter Padawitz.  Strategy-Controlled Reduction and Narrowing , 1987, RTA.

[5]  Nachum Dershowitz,et al.  A Rationale for Conditional Equational Programming , 1990, Theor. Comput. Sci..

[6]  Gert Smolka,et al.  The Oz Programming Model , 1996, Computer Science Today.

[7]  Puri Arenas,et al.  Functional Plus Logic Programming with Built-In and Symbolic Constraints , 1999, PPDP.

[8]  Mario Rodríguez-Artalejo,et al.  Denotational Versus Declarative Semantics for Functional Programming , 1991, CSL.

[9]  Annegret Habel,et al.  Complete Strategies for Term Graph Narrowing , 1998, WADT.

[10]  Sergio Antoy.  Optimal Non-deterministic Functional Logic Computations , 1997, ALP/HOA.

[11]  Mario Rodríguez-Artalejo,et al.  On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming , 1992, CSL.

[12]  Annegret Habel,et al.  Term graph narrowing , 1996, Mathematical Structures in Computer Science.

[13]  Corrado Moiso,et al.  A Completeness Result for E-unification Algorithms Based on Conditional Narrowing , 1986, Foundations of Logic and Functional Programming.

[14]  Michael Hanus,et al.  Curry: an integrated functional logic language (version 0 , 2003 .

[15]  Jürgen Avenhaus,et al.  Higher Order Conditional Rewriting and Narrowing , 1994, CCL.

[16]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[17]  Steffen Hölldobler,et al.  Foundations of Equational Logic Programming , 1989, Lecture Notes in Computer Science.

[18]  Hélène Kirchner,et al.  ELAN: A logical framework based on computational systems , 1996, WRLA.

[19]  Peter D. Mosses,et al.  Denotational semantics , 1995, LICS 1995.

[20]  Juan José Moreno-Navarro,et al.  Implementing a Lazy Functional Logic Language with Disequality Constraints , 1992, JICSLP.

[21]  Francisco Javier López-Fraguas,et al.  An Approach to Declarative Programming Based on a Rewriting Logic , 1999, J. Log. Program..

[22]  Rita Loogen,et al.  A Demand Driven Computation Strategy for Lazy Narrowing , 1993, PLILP.

[23]  Mario Rodríguez-Artalejo,et al.  A Rewriting Logic for Declarative Programming , 1996, ESOP.

[24]  Razvan Diaconescu,et al.  An overview of CafeOBJ , 1998, WRLA.

[25]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[26]  Gopalan Nadathur,et al.  Higher-Order Logic Programming , 1986, ICLP.

[27]  Wayne Snyder,et al.  Higher-Order Unification Revisited: Complete Sets of Transformations , 1989, J. Symb. Comput..

[28]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[29]  Mario Rodríguez-Artalejo,et al.  A Higher Order Rewriting Logic for Functional Logic Programming , 1997, ICLP.

[30]  James R. Slagle,et al.  Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity , 1974, JACM.

[31]  Uday S. Reddy,et al.  Narrowing as the Operational Semantics of Functional Languages , 1985, SLP.

[32]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[33]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[34]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[35]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[36]  Rachid Echahed,et al.  On Completeness of Narrowing Strategies , 1990, Theor. Comput. Sci..

[37]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[38]  Rachid Echahed,et al.  Uniform Narrowing Strategies , 1992, ALP.

[39]  Michael J. Maher,et al.  The Semantics of Constraint Logic Programs , 1998, J. Log. Program..

[40]  Mario Rodríguez-Artalejo,et al.  A Lazy Narrowing Calculus for Functional Logic Programming with Algebraic Polymorphic Types , 1997, ILPS.

[41]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .

[42]  Heinrich Hußmann,et al.  Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting , 1992, J. Log. Program..

[43]  Michael Kifer,et al.  HILOG: A Foundation for Higher-Order Logic Programming , 1993, J. Log. Program..

[44]  Corrado Moiso,et al.  Kernel-LEAF: A Logic plus Functional Language , 1991, J. Comput. Syst. Sci..

[45]  Christian Prehofer,et al.  Higher-order narrowing , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[46]  Tetsuo Ida,et al.  A Complete Narrowing Calculus for Higher-Order Functional Logic Programming , 1995, PLILP.

[47]  Taro Suzuki,et al.  On Reducing the Search Space of Higher-Order Lazy Narrowing , 1999, Fuji International Symposium on Functional and Logic Programming.

[48]  Lee Naish,et al.  Negation and Control in Prolog , 1986, Lecture Notes in Computer Science.

[49]  Juan José Moreno-Navarro,et al.  Logic Programming with Functions and Predicates: The Language BABEL , 1992, J. Log. Program..

[50]  Jia-Huai You,et al.  Enumarating Outer Narrowing Derivations for Constructor-Based Term Rewriting Systems , 1989, J. Symb. Comput..

[51]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[52]  Mario Rodríguez-Artalejo,et al.  Semantics and Types in Functional Logic Programming , 1999, Fuji International Symposium on Functional and Logic Programming.

[53]  Tetsuo Ida,et al.  Leftmost outside-in narrowing calculi , 1997, Journal of Functional Programming.

[54]  Michael Hanus,et al.  Efficient Translation of Lazy Functional Logic Programs into Prolog , 1995, LOPSTR.

[55]  Rachid Echahed,et al.  A needed narrowing strategy , 2000, JACM.

[56]  Philip Wadler,et al.  Packrat parsing:: simple, powerful, lazy, linear time, functional pearl , 2002, ICFP '02.

[57]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[58]  Christian Prehofer,et al.  Solving Higher-Order Equations , 1998, Progress in Theoretical Computer Science.

[59]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[60]  Lee Naish.  A Declarative Debugging Scheme , 1997, J. Funct. Log. Program..

[61]  Aart Middeldorp,et al.  A Deterministic Lazy Narrowing Calculus , 1998, J. Symb. Comput..

[62]  John W. Lloyd,et al.  Declarative Programming in Escher , 1995 .

[63]  Kim Marriott.  Constraint multiset grammars , 1994, Proceedings of 1994 IEEE Symposium on Visual Languages.

[64]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[65]  Laurent Fribourg,et al.  Implementation of narrowing: the Prolog-based approach , 1993 .

[66]  Maurizio Gabbrielli,et al.  The s-Semantics Approach: Theory and Applications , 1994, J. Log. Program..

[67]  Carl A. Gunter,et al.  Semantic Domains , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[68]  Christian Prehofer,et al.  A Call-by-Need Strategy for Higher-Order Functional-Logic Programming , 1995, ILPS.

[69]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[70]  Puri Arenas,et al.  Embedding Multiset Constraints into a Lazy Functional Logic Language , 1998, PLILP/ALP.

[71]  Christian Prehofer,et al.  Solving higher order equations: from logic to programming , 2012 .

[72]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[73]  Sergio Antoy,et al.  Lazy Evaluation in Logic , 1991, PLILP.

[74]  Giorgio Levi,et al.  A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs , 1993, Inf. Comput..

[75]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[76]  Werner Nutt,et al.  Basic Narrowing Revisited , 1989, J. Symb. Comput..

[77]  Elio Giovannetti,et al.  IDEAL: An Ideal Deductive Applicative Language , 1986, SLP.

[78]  Narciso Martí-Oliet,et al.  Action and Change in Rewriting Logic , 1999 .

[79]  Daniel Le Métayer,et al.  The GAMMA Model and Its Discipline of Programming , 1990, Sci. Comput. Program..

[80]  José Meseguer,et al.  Models and Equality for Logical Programming , 1987, TAPSOFT, Vol.1.

[81]  Laurent Fribourg,et al.  SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting , 1985, SLP.

[82]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[83]  Michael Hanus,et al.  A Functional and Logic Language with Polymorphic Types (Extended Abstract) , 1990, DISCO.

[84]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[85]  Patrick Lincoln,et al.  Le Fun: Logic, Equations and Functions , 1987, SLP.

[86]  Puri Arenas,et al.  Combining Lazy Narrowing with Disequality Constraints , 1994, PLILP.

[87]  John W. Lloyd,et al.  Programming in an Integrated Functional and Logic Language , 1999, J. Funct. Log. Program..

[88]  Michael J. Maher,et al.  A Theory of Complete Logic Programs with Equality , 1984, J. Log. Program..