Filters








73,789 Hits in 5.6 sec

A debugging model for functional logic programs [chapter]

Michael Hanus, Berthold Josephs
1993 Lecture Notes in Computer Science  
The responsibility for the contents of this publication lies with the authors.  ...  Acknowledgements The research described in this paper was partially funded by the German Ministry for Research and Technology (BMFT) under grant ITS 9103.  ...  Our debugging model can also be used for other functional logic languages which use some variant of innermost narrowing as their operational semantics.  ... 
doi:10.1007/3-540-57186-8_69 fatcat:bfj7gn4ynrh2xeu7zduhxfrnjy

The relation between logic and functional languages: a survey

Marco Bellia, Giorgio Levi
1986 The Journal of Logic Programming  
Narrowing is complete as the operational semantics of a logic language based on equations.  ...  The operational semantics of equational languages, like the semantics of any functional language, can be defined in terms of reductions (or rewritings).  ...  In the case of first-order logic programming, this need has led to the language-metalanguage amalgamation proposal [lo, 111, which is less powerful than higher-order logic and sometimes rather difficult  ... 
doi:10.1016/0743-1066(86)90014-2 fatcat:kzu7tvyz2fajvlsl767fgczjfe

Towards a Theory of Reach [chapter]

Jonathan Fowler, Graham Huttom
2016 Lecture Notes in Computer Science  
In previous work, Naylor and Runciman have developed a reachability solver for Haskell, based on the use of lazy narrrowing from functional logic programming.  ...  In this paper, we lay the groundwork for an underlying theory of such a system, by formally establishing the correctness of a simple reach solver.  ...  Acknowledgements We would like to thank members of the Functional Programming Lab in Nottingham for useful comments and suggestions regarding this work.  ... 
doi:10.1007/978-3-319-39110-6_2 fatcat:akp5wqoaanfebjha7fkseievwa

Equational logic programming

Jia-Huai You, P. A. Subrahmanyam
1986 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86  
Semantic foundations for the extension are discussed.  ...  The extended language is u powerful logic programming language in the sense of Prolog and thus enjoys the programming features that Prolog possesses.  ...  The work by Jia-Huai You was supported in part by ONR Contract N00014-Sa-K-0317, and was done when he was at the Computer Science Department, University of Utah.  ... 
doi:10.1145/512644.512663 dblp:conf/popl/YouS86 fatcat:k2dt7lkapjcw3igwfvgfmqwxwa

Page 6314 of Mathematical Reviews Vol. , Issue 93k [page]

1993 Mathematical Reviews  
The point of departure of the authors is the observation that arithmetic operations of Prolog can be viewed as calls to externally defined functions.  ...  Finally, it is explained how a prototype implementation of the language was obtained from the operational semantics. This implementation consists of a compilation of the source language to Prolog.  ... 

JML Support for Primitive Arbitrary Precision Numeric Types: Definition and Semantics

Patrice Chalin
2004 Journal of Object Technology  
With the objective of better matching user expectations we introduce JMLb, a variant of JML supporting primitive arbitrary precision numeric types as well as "math modes" to control the semantics of arithmetic  ...  We examine how the problem may manifest itself in other languages (such as Eiffel, Spark and the UML/OCL-Java notation of the KeY project) and comment on the applicability of our solution.  ...  On the other hand, narrowing to type τ requires the application of the narrow function defined in the theory of τ.• Interpretation of a pre-state expression is simply achieved by changing the elaboration  ... 
doi:10.5381/jot.2004.3.6.a3 fatcat:2sffrjsakjbdfguaxgafmrlfb4

A Monadic Semantics for Core Curry1 1This work has been supported in part by the National Science Foundation under grants CCR-0110496 and CCR-0218224

Andrew Tolmach, Sergio Antoy
2003 Electronical Notes in Theoretical Computer Science  
We give a deterministic, big-step operational semantics for the essential core of the Curry language, including higher-order functions, call-by-need evaluation, nondeterminism, narrowing, and residuation  ...  The semantics is structured in modular monadic style, and is presented in the form of an executable interpreter written in Haskell.  ...  The Functional Language Interpreter The abstract syntax for the functional part of our core expression language is given as a Haskell data type definition in Figure 1 .  ... 
doi:10.1016/s1571-0661(04)80691-1 fatcat:zqlcoplonvdzhntlk4jvrmoic4

Reduction Strategies for Declarative Programming

Michael Hanus
2001 Electronical Notes in Theoretical Computer Science  
On the other hand, they should also support the programmers to write programs in a declarative way ignoring the influence of the evaluation strategy to the success of a computation as good as possible.  ...  This paper surveys reduction or evaluation strategies for functional and functional logic programs.  ...  Therefore, the reduction strategies developed for general term rewriting systems had only a limited impact on the operational semantics of programming languages.  ... 
doi:10.1016/s1571-0661(04)00273-7 fatcat:jtcnfes5ireuxlctdpm6nxkehm

A tiny constraint functional logic language and its continuation semantics [chapter]

Andy Mück, Thomas Streicher, Hendrik C. R. Lock
1994 Lecture Notes in Computer Science  
We define a denotational semantics based on continuation passing style. The operational semantics of our language is given as a set of reduction rules.  ...  We prove soundness of the operational semantics w.r.t, the continuation semantics. Finally, we show how pure functional logic programs can be translated to this core language in a sound way.  ...  This work partially has been sponsored by the ESPRIT working group COMPASS.  ... 
doi:10.1007/3-540-57880-3_29 fatcat:4bpml24k4rahrneok64uo6tupq

A Semantic Web Reasoner for Rules, Equations and Constraints [chapter]

Daniel Elenius, Grit Denker, Mark-Oliver Stehr
2008 Lecture Notes in Computer Science  
This allows for a behavior similar to that of a logic programming system, while constraint simplification rules as well as operations can easily be defined and processed.  ...  However, the term rewriting engine Maude, augmented with narrowing, provides a promising reasoning mechanism.  ...  ACKNOWLEDGMENTS We thank Steven Eker (SRI) for maintaining the Maude system and responding to our feature requests, including the entire narrowing functionality.  ... 
doi:10.1007/978-3-540-88737-9_11 fatcat:yq2ioj6fabgqtcpmpxmn6qe6nq

Functional Logic Programming: From Theory to Curry [chapter]

Michael Hanus
2013 Lecture Notes in Computer Science  
The declarative multi-paradigm language Curry is influenced by recent advances in the foundations and implementation of functional logic languages.  ...  The development of Curry is an international initiative intended to provide a common platform for the research, teaching, and application of integrated functional logic languages.  ...  Furthermore, I would like to thank Sergio Antoy, Bernd Braßel, and Germán Vidal for their constructive remarks to improve the readability of the paper.  ... 
doi:10.1007/978-3-642-37651-1_6 fatcat:bi7s3wzbvbh5xf57gsox7uhhjq

Implementing functional logic languages using multiple threads and stores

Andrew Tolmach, Sergio Antoy, Marius Nita
2004 Proceedings of the ninth ACM SIGPLAN international conference on Functional programming - ICFP '04  
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification, narrowing, fair search  ...  The language specified by our interpreter is designed so that programs are deterministic in a novel and useful sense.  ...  Acknowledgements We thanks the anonymous referees for several helpful suggestions. References  ... 
doi:10.1145/1016850.1016865 dblp:conf/icfp/TolmachAN04 fatcat:hkt7qzqxjnfrhpf3p5qo3tmipy

Implementing functional logic languages using multiple threads and stores

Andrew Tolmach, Sergio Antoy, Marius Nita
2004 SIGPLAN notices  
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification, narrowing, fair search  ...  The language specified by our interpreter is designed so that programs are deterministic in a novel and useful sense.  ...  Acknowledgements We thanks the anonymous referees for several helpful suggestions. References  ... 
doi:10.1145/1016848.1016865 fatcat:dmcts4dxlfbt5kms44u7depi4y

Abstract interpretation

Patrick Cousot
1996 ACM Computing Surveys  
as a parameter, either that of the program to be analyzed or that of a programming language.  ...  We review how the dependence upon semantics has been taken into account in abstract interpretation based program analysis and next propose to design general purpose abstract interpreters taking semantics  ...  higher-order domain-theoretic denotational semantics of functional languages.  ... 
doi:10.1145/234528.234740 fatcat:7sf2zvjdfrcnxmggblh7bgs6mm

Page 6048 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
Summary: “We introduce a semantic characterization of narrow- ing, the computational engine of many functional logic languages.  ...  The motivation is to obtain an abstract semantics which encodes information about the real oper- ational framework used by a given (narrowing-based) functional logic language.  ... 
« Previous Showing results 1 — 15 out of 73,789 results