Functional and Logic Programming

proceedings of the 11th International symposium on Functional and Logic Programming (FLOPS 2012), held in Kobe, Japan, May 23-25, 2012

[1]  Dennis F. Kibler,et al.  Parallel interpretation of logic programs , 1981, FPCA '81.

[2]  Torben Æ. Mogensen.  A Semantics-Based Determinacy Analysis for Prolog with Cut , 1996, Ershov Memorial Conference.

[3]  Cadence Berkeley Labs.  Applications of Craig Interpolants in Model Checking , 2005 .

[4]  Michael Hanus,et al.  Set functions for functional logic programming , 2009, PPDP '09.

[5]  Rita Loogen,et al.  Visualizing Parallel Functional Program Runs: Case Studies with the Eden Trace Viewer , 2007, PARCO.

[6]  Antoine Miné,et al.  The octagon abstract domain , 2001, High. Order Symb. Comput..

[7]  Sebastian Fischer,et al.  Purely functional lazy nondeterministic programming , 2011, J. Funct. Program..

[8]  D. H. D. Warren.  22 Higher-order extensions to PROLOG : are they needed ? , 2013 .

[9]  Wayne Luk,et al.  A scalable hardware architecture for prime number validation , 2004, Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921).

[10]  Michael Hanus,et al.  Multi-paradigm Declarative Languages , 2007, ICLP.

[11]  Yoichi Hirai,et al.  An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory , 2010, LPAR.

[12]  Sergio Antoy.  Evaluation strategies for functional logic programming , 2005, J. Symb. Comput..

[13]  Bernd Brassel,et al.  On a Tighter Integration of Functional and Logic Programming , 2007, APLAS.

[14]  Matthieu Sozeau.  A New Look at Generalized Rewriting in Type Theory , 2009, J. Formaliz. Reason..

[15]  A. Avron.  The method of hypersequents in the proof theory of propositional non-classical logics , 1996 .

[16]  Leonard M. Adleman,et al.  On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[17]  Jean-Christophe Janodet,et al.  Admissible Graph Rewriting and Narrowing , 1998, IJCSLP.

[18]  Philippe de Groote,et al.  On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions , 2002, Inf. Comput..

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

[20]  Ramin Sadre,et al.  An Abstract Machine for Curry and Its Concurrent Implementation in Java , 1999, J. Funct. Log. Program..

[21]  Neil Brown,et al.  Communicating Haskell Processes: Composable Explicit Concurrency using Monads , 2008, CPA.

[22]  Dan Sahlin.  Determinacy Analysis for Full Prolog , 1991, PEPM.

[23]  Manuel V. Hermenegildo,et al.  Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses , 2008, New Generation Computing.

[24]  Michael Hanus,et al.  Overlapping Rules and Logic Variables in Functional Logic Programs , 2006, ICLP.

[25]  Andy King,et al.  Inferring Argument Size Relationships with CLP(R) , 1996, LOPSTR.

[26]  Francisco Azevedo.  Cardinal: A Finite Sets Constraint Solver , 2006, Constraints.

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

[28]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[29]  Sebastian Fischer,et al.  Declaring Numbers , 2008, WFLP@RDP.

[30]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[31]  H. Lenstra,et al.  Primalitv Testing and Jacobi Sums , 2010 .

[32]  Michael Hanus,et al.  Functional logic programming , 2010, CACM.

[33]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[34]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[35]  Sergio Antoy,et al.  On the correctness of pull-tabbing , 2011, Theory and Practice of Logic Programming.

[36]  C. R. Ramakrishnan,et al.  Extracting Determinacy in Logic Programs , 1993, ICLP.

[37]  Christian G. Fermüller,et al.  Parallel Dialogue Games and Hypersequents for Intermediate Logics , 2003, TABLEAUX.

[38]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[39]  Eli Gafni,et al.  Immediate atomic snapshots and fast renaming , 1993, PODC '93.

[40]  Sergio Antoy,et al.  Programming with Narrowing , 2002 .

[41]  Sergio Antoy.  Constructor-based conditional narrowing , 2001, PPDP '01.

[42]  Michael Dummett,et al.  A propositional calculus with denumerable matrix , 1959, Journal of Symbolic Logic (JSL).

[43]  Christian G. Fermüller,et al.  A Natural Deduction System for Intuitionistic Fuzzy Logic , 2001 .

[44]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[45]  J. C. Gonz Alez-Moreno,et al.  An Approach to Declarative Programming Based on a Rewriting Logic , 2022 .

[46]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[47]  Francisco Javier López-Fraguas,et al.  Extra Variables Can Be Eliminated from Functional Logic Programs , 2007, Electron. Notes Theor. Comput. Sci..

[48]  Shmuel Zaks,et al.  A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor , 1988, PODC '88.

[49]  Peter H. Welch,et al.  Graceful Termination -- Graceful Resetting , 1989 .

[50]  H. R. Walters,et al.  Simulating TRSs by minimal TRSs : a simple, efficient, and correct compilation technique , 1996 .

[51]  Wan Fokkink,et al.  Simulation as a Correct Transformation of Rewrite Systems , 1997, MFCS.

[52]  Maurice Herlihy,et al.  Impossibility and universality results for wait-free synchronization , 1988, PODC '88.

[53]  Cédric Fournet,et al.  The Join Calculus: A Language for Distributed Mobile Programming , 2000, APPSEM.

[54]  O. ShlomoM.  EXTENDED IMPOSSIBILITY RESULTS FOR ASYNCHRONOUS COMPLETE NETWORKS , 2002 .

[55]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

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

[57]  Kazushige Terui,et al.  From Axioms to Analytic Rules in Nonclassical Logics , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[58]  Roberto Di Cosmo,et al.  Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums , 2004, POPL.