13th International Workshop on Functional and (Constraint) Logic Programming
暂无分享,去创建一个
[1] Moreno Falaschi,et al. Symbolic Model Checking for Timed Concurrent Constraint Programs , 2003 .
[2] Gopalan Nadathur,et al. A proof procedure for the logic of hereditary Harrop formulas , 2004, Journal of Automated Reasoning.
[3] Michael Hanus,et al. An Open System to Support Web-based Learning , 2003 .
[4] Michael Hanus,et al. An Integrated Development Environment for Declarative Multi-Paradigm Programming , 2001, WLPE.
[5] Gert Smolka,et al. Records for Logic Programming , 1994, J. Log. Program..
[6] Giorgio Levi,et al. A Theory of Observables for Logic Programs , 2001, Inf. Comput..
[7] Colin Runciman,et al. Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs , 2000, IFL.
[8] Axel Simon,et al. Typeview: A Tool for Understanding Type Errors , 2000 .
[9] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[10] Olaf Chitil,et al. Compositional explanation of types and algorithmic debugging of type errors , 2001, ICFP '01.
[11] Michael Hanus,et al. Compiling Multi-Paradigm Declarative Programs into Prolog , 2000, FroCoS.
[12] Rafael Caballero,et al. Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs , 2001, FLOPS.
[13] Mario Rodríguez-Artalejo,et al. Functional and Constraint Logic Programming , 2001, CCL.
[14] A. Jefferson Offutt,et al. Constraint-Based Automatic Test Data Generation , 1991, IEEE Trans. Software Eng..
[15] Gert Smolka,et al. The Oz Programming Model , 1996, Computer Science Today.
[16] Gopal Gupta,et al. Analysis of Or-parallel execution models , 1993, TOPL.
[17] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[18] Rachid Echahed,et al. Abstraction of Conditional Term Rewriting Systems , 1995, ILPS.
[19] María Alpuente,et al. Correction of Functional Logic Programs , 2003, ESOP.
[20] Mario Rodríguez-Artalejo,et al. Constraint Logic Programming with Hereditary Harrop formulas , 1997, Theory and Practice of Logic Programming.
[21] John W. Lloyd,et al. Programming in an Integrated Functional and Logic Language , 1999, J. Funct. Log. Program..
[22] Kwangkeun Yi,et al. Proofs about a folklore let-polymorphic type inference algorithm , 1998, TOPL.
[23] Wolfgang Lux. Implementing Encapsulated Search for a Lazy Functional Logic Language , 1999, Fuji International Symposium on Functional and Logic Programming.
[24] James Lipton,et al. A new framework for declarative programming , 2003, Theor. Comput. Sci..
[25] Lee Naish. All Solutions Predicates in Prolog , 1985, SLP.
[26] Ramin Sadre,et al. Pakcs: The portland aachen kiel curry system , 2000 .
[27] Herbert Kuchen,et al. An Efficient Abstract Machine for Curry , 1999, GI Jahrestagung.
[28] Dominic Duggan,et al. Explaining Type Inference , 1996, Sci. Comput. Program..
[29] Henrik Nilsson,et al. How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger , 2001, Journal of Functional Programming.
[30] Michael Hanus,et al. Distributed Programming in a Multi-Paradigm Declarative Language , 1999, PPDP.
[31] Gabriella Kókai,et al. Algorithmic Debugging and Testing of Prolog Programs , 1997, LPE.
[32] Michael J. Maher,et al. The Semantics of Constraint Logic Programs , 1998, J. Log. Program..
[33] Richard A. O'Keefe,et al. Efficient Implementation of a Defensible Semantics for Dynamic PROLOG Code , 1987, International Conference on Logic Programming.
[34] María Alpuente,et al. A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424. , 2002 .
[35] G. Nemhauser,et al. Integer Programming , 2020 .
[36] Michael J. Maher,et al. Constraint Logic Programming: A Survey , 1994, J. Log. Program..
[37] Francisco Javier López-Fraguas,et al. An Approach to Declarative Programming Based on a Rewriting Logic , 1999, J. Log. Program..
[38] Maurizio Gabbrielli,et al. Observable Semantics for Constraint Logic Programs , 1995, J. Log. Comput..
[39] Christian Schulte,et al. Programming Constraint Inference Engines , 1997, CP.
[40] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.
[41] Herbert B. Enderton,et al. A mathematical introduction to logic , 1972 .
[42] Michael Hanus,et al. An implementation of narrowing strategies , 2001, PPDP '01.
[43] Marco Pistore,et al. Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.
[44] Gianluca Amato,et al. Indexed Categories and Bottom-Up Semantics of Logic Programs , 2001, LPAR.
[45] Michael Hanus,et al. Type-based nondeterminism checking in functional logic programs , 2000, PPDP '00.
[46] Colin Runciman,et al. Transforming Haskell for Tracing , 2002, IFL.
[47] Patrick Lincoln,et al. Le Fun: Logic, Equations and Functions , 1987, SLP.
[48] Sergio Antoy,et al. Typed Higher-Order Narrowing without Higher-Order Strategies , 1999, Fuji International Symposium on Functional and Logic Programming.
[49] Germán Vidal,et al. Operational Semantics for Functional Logic Languages , 2002, WFLP.
[50] Michael Hanus,et al. A Debugging Model for Functional Logic Programs , 1993, PLILP.
[51] Dana S. Scott,et al. Concurrent constraint programming languages , 1989 .
[52] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .
[53] Greg J. Michaelson,et al. A visualisation of polymorphic type checking , 2000, J. Funct. Program..
[54] Herbert Kuchen,et al. GlassTT - A Symbolic Java Virtual Machine using Constraint Solving Techniques for Glass-Box Test Case Generation , 2003 .
[55] Tesis Doctoral,et al. Una aproximaci on al fallo en programaci on declarativa multiparadigma , 2004 .
[56] Martin Erwig,et al. Visual type inference , 2006, J. Vis. Lang. Comput..
[57] Peter Padawitz. Inductive Theorem Proving for Design Specification , 1996, J. Symb. Comput..
[58] Thom W. Frühwirth,et al. Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..
[59] Ehud Shapiro,et al. Algorithmic Program Debugging , 1983 .
[60] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[61] Mats Carlsson,et al. Variable Shunting for the WAM , 1991 .
[62] Enrico Pontelli,et al. ACE: And/Or-parallel Copying-based Execution of Logic Programs , 1994, ICLP.
[63] Mitchell Wand. Finding the source of type errors , 1986, POPL '86.
[64] Heinrich Hußmann,et al. Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting , 1992, J. Log. Program..
[65] Mario Rodríguez-Artalejo,et al. A Declarative Debugging System for Lazy Functional Logic Programs , 2002, WFLP.
[66] Manuel M. T. Chakravarty,et al. Towards the Uniform Implementation of Declarative Languages , 1997, Comput. Lang..
[67] Michael Hanus,et al. Architecture of a Virtual Machine for Functional Logic Computations , 2003 .
[68] Michael Hanus,et al. A unified computation model for functional and logic programming , 1997, POPL '97.
[69] Philip Wadler,et al. How to declare an imperative , 1997, CSUR.
[70] Mokhtar S. Bazaraa,et al. Nonlinear Programming: Theory and Algorithms , 1993 .
[71] Christian Schulte,et al. An Abstract Machine for Oz , 1995, PLILP.
[72] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[73] Colin Runciman,et al. Tracing Lazy Functional Computations Using Redex Trails , 1997, PLILP.
[74] Alicia Villanueva,et al. Model checking for the concurrent constraint paradigm: Thesis , 2004 .
[75] Uday S. Reddy,et al. Narrowing as the Operational Semantics of Functional Languages , 1985, SLP.
[76] George B. Dantzig,et al. Fourier-Motzkin Elimination and Its Dual , 1973, J. Comb. Theory, Ser. A.
[77] Zoltan Somogyi,et al. The Execution Algorithm of Mercury, an Efficient Purely Declarative Logic Programming Language , 1996, J. Log. Program..
[78] C. V. Ramamoorthy,et al. On the Automated Generation of Program Test Data , 1976, IEEE Transactions on Software Engineering.
[79] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[80] Sergio Antoy. Definitional Trees , 1992, ALP.
[81] Sergio Antoy. Optimal Non-deterministic Functional Logic Computations , 1997, ALP/HOA.
[82] Maurizio Gabbrielli,et al. A temporal logic for reasoning about timed concurrent constraint programs , 2001, Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.
[83] José Meseguer,et al. Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..
[84] Prakash Panangaden,et al. The semantic foundations of concurrent constraint programming , 1991, POPL '91.
[85] Kenneth L. McMillan,et al. Symbolic model checking: an approach to the state explosion problem , 1992 .
[86] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[87] Jurriaan Hage,et al. Scripting the type inference process , 2003, ICFP '03.
[88] Michael Hanus,et al. The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..
[89] Susana Nieva,et al. A Higher-Order Logic Programming Language with Constraints , 2001, FLOPS.
[90] Dale Miller,et al. A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..
[91] H B Curry,et al. Functionality in Combinatory Logic. , 1934, Proceedings of the National Academy of Sciences of the United States of America.
[92] J. Garloff,et al. Solving strict polynomial inequalities by Bernstein expansion , 1999 .
[93] Boris Beizer,et al. Software Testing Techniques , 1983 .
[94] Daan Leijen,et al. Domain specific embedded compilers , 1999, DSL '99.
[95] Michael Hanus,et al. High-Level Server Side Web Scripting in Curry , 2001, PADL.
[96] Rafael Caballero,et al. Declarative Debugging for Encapsulated Search , 2002, Electron. Notes Theor. Comput. Sci..
[97] Michael Hanus,et al. Controlling Search in Declarative Programs , 1998, PLILP/ALP.
[98] Christian Schulte. Oz Explorer: A Visual Constraint Programming Tool , 1996, PLILP.
[99] Christian Haack,et al. Type error slicing in implicitly typed higher-order languages , 2004, Sci. Comput. Program..
[100] Simon L. Peyton Jones,et al. Avoiding Unnecessary Updates , 1992, Functional Programming.
[101] Colin Runciman,et al. Multiple-View Tracing for Haskell: a New Hat , 2001 .
[102] Maurizio Gabbrielli,et al. A Timed Concurrent Constraint Language , 2000, Inf. Comput..
[103] Michael Hanus,et al. Functional Logic Design Patterns , 2002, FLOPS.
[104] Miguel Palomino Tarjuelo. Comparing Meseguer's Rewriting Logic with the Logic CRWL , 2002, Electron. Notes Theor. Comput. Sci..
[105] Puri Arenas,et al. A Debugging Model for Lazy Functional Logic Languages , 1994, GULP-PRODE.
[106] Gill Andy. Debugging Haskell by Observing Intermediate Data Structures , 2001 .
[107] Hassan Aït-Kaci,et al. An Overview of LIFE , 1990, East/West Database Workshop.
[108] Peter Padawitz,et al. Swinging types=functions+relations+transition systems , 2000, Theor. Comput. Sci..
[109] Maurizio Gabbrielli,et al. A Compositional Semantics for Logic Programs , 1994, Theor. Comput. Sci..
[110] Subrata Kumar Das,et al. Deductive Databases and Logic Programming , 1992 .
[111] Michael Hanus,et al. Encapsulating Non-Determinism in Functional Logic Computations , 2004, J. Funct. Log. Program..
[112] Gregory F. Johnson,et al. Stores and partial continuations as first-class objects in a language and its environment , 1988, POPL '88.
[113] Sergio Antoy. Constructor-based conditional narrowing , 2001, PPDP '01.
[114] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.
[115] Lee Naish,et al. Adding equations to NU-Prolog , 1991, PLILP.
[116] Ralf Hinze,et al. Haskell 98 — A Non−strict‚ Purely Functional Language , 1999 .
[117] Mary Lou Soffa,et al. Generating test data for branch coverage , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.
[118] Sandra Alves,et al. Type Inference using Constraint Handling Rules , 2002, Electron. Notes Theor. Comput. Sci..
[119] Giuliano Antoniol,et al. Automatic unit test data generation using mixed-integer linear programming and execution trees , 1999, Proceedings IEEE International Conference on Software Maintenance - 1999 (ICSM'99). 'Software Maintenance for Business Change' (Cat. No.99CB36360).
[120] Benjamin C. Pierce,et al. Types and programming languages: the next generation , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..
[121] Gregory F. Johnson,et al. A maximum-flow approach to anomaly isolation in unification-based incremental type inference , 1986, POPL '86.
[122] Michael Hanus,et al. Observing Functional Logic Computations , 2004, PADL.
[123] Rachid Echahed,et al. Combining Mobile Processes and Declarative Programming , 2000, Computational Logic.
[124] Gert Smolka,et al. Encapsulated Search for Higher-order Concurrent Constraint Programming , 1994, ILPS.
[125] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .
[126] Christian Schulte. Comparing Trailing and Copying for Constraint Programming , 1999, ICLP.
[127] Michael Hanus,et al. A Functional Logic Programming Approach to Graphical User Interfaces , 2000, PADL.
[128] Moreno Falaschi,et al. Under Consideration for Publication in Theory and Practice of Logic Programming Automatic Verification of Timed Concurrent Constraint Programs * , 2022 .
[129] Ralph Johnson,et al. design patterns elements of reusable object oriented software , 2019 .
[130] Yike Guo,et al. The minimised geometric Buchberger algorithm: an optimal algebraic algorithm for integer programming , 1997, ISSAC.
[131] Lee Naish,et al. Automating Control for Logic Programs , 1985, J. Log. Program..
[132] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[133] Radha Jagadeesan,et al. Programming in Timed Concurrent Constraint Languages , 1993, NATO ASI CP.
[134] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.
[135] Gert Smolka,et al. Encapsulated Search and Constraint Programming in Oz , 1994, PPCP.
[136] Dino Pedreschi,et al. Verification of Logic Programs , 1999, J. Log. Program..
[137] Henrik Reif Andersen,et al. Difference Decision Diagrams , 1999, CSL.
[138] Gopalan Nadathur,et al. Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..
[139] B. Buchberger,et al. Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .
[140] A. Tarski,et al. Cylindric Algebras. Part II , 1988 .
[141] Rafael Caballero,et al. A Functional-Logic Perspective on Parsing , 1999, Fuji International Symposium on Functional and Logic Programming.
[142] Ramin Sadre,et al. An Abstract Machine for Curry and Its Concurrent Implementation in Java , 1999, J. Funct. Log. Program..
[143] Lawrence C. Paulson,et al. Logic and computation - interactive proof with Cambridge LCF , 1987, Cambridge tracts in theoretical computer science.