A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
2011
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
This paper presents a theoretical framework for the integration of the cooperative constraint solving of numeric constraint domains into higher-order functional and logic programming on λ-abstractions, ...
cooperation among the numeric domains and a novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. ...
Higher-Order Cooperative Programming in CFLP (C) We are now ready to present our computation framework for higher-order functional and logic programming with cooperation of algebraic constraint domains ...
doi:10.1016/j.entcs.2011.03.005
fatcat:yvvzdwi5jrg23ozbkdaoozcltm
TOY: A System for Experimenting with Cooperation of Constraint Domains
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper presents, from a user point-of-view, the mechanism of cooperation between constraint domains that is currently part of the system T OY , an implementation of a constraint functional logic programming ...
This provides a powerful mechanism to define higher order constraints. ...
A Constraint Functional Logic Programming Scheme T OY implements a Constraint Functional Logic Programming scheme CF LP (D) over a parametrically given constraint domain D, proposed in [14] . ...
doi:10.1016/j.entcs.2009.12.006
fatcat:dkzbcwoc6re5jklmpcjgisd77e
Page 1833 of Mathematical Reviews Vol. , Issue 98C
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
of abstract domains using first-order logic (209-223); Paolo Volpe, Abstractions of uniform proofs (224-237); Roberto Giacobazzi and Francesco Ranzato, Complementing logic program semantics (238-253); ...
61); Frédéric Benhamou, Heterogeneous constraint solving (62-76); Frangois Fages and Roberta Gori, A hierarchy of semantics for normal constraint logic programs (77-91); Pe- ter Csaba Olveczky and Olav ...
Page 3954 of Mathematical Reviews Vol. , Issue 92g
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The author presents a higher-order calculus ECC which combines the ideas of T. Coquand and G. ...
This is a survey of the ideas and methods of mathematical logic as used in modern programming and includes a reference list of 178 items. ...
A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming
2007
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a proposal for the cooperation of solvers in constraint functional logic programming, a quite expressive programming paradigm which combines functional, logic and constraint programming ...
We restrict our attention to the cooperation of three solvers, dealing with syntactic equality and disequality constraints, real arithmetic constraints, and finite domain (FD) constraints, respectively ...
Adding a F P dimension to CLP has led to various proposals of CF LP schemes for Constraint Functional Logic Programming, developed since 1991 and aiming at a very expressive combination of CP , higher-order ...
doi:10.1016/j.entcs.2007.05.037
fatcat:2huvud6lg5gufijxqwpbg3il2m
Page 2932 of Mathematical Reviews Vol. , Issue 90E
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Lambek and P. J. Scott’s book Introduction to higher order categorical logic [Cambridge Univ. Press, Cambridge, 1986; MR 88a:03032] and is very much in the spirit of that book. ...
There is no interpretation of the results obtained and no comparison of the algebras presented to the known algebras of programs, such as algorithmic or dynamic algebras [cf. V. R. ...
Page 5085 of Mathematical Reviews Vol. , Issue 93i
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Wadge, Higher-order Horn logic programming (289-303); Raghu Ramakrishnan and S. Sudarshan, Top-down vs. bottom-up revisited (321-336); David B. Kemp, Peter J. ...
The one hundred forty-four papers in this collection include the following: Sarit Kraus and Jonathan Wilkenfeld, The function of time in cooperative negotiations (179-184); James Bowen and Dennis Bahler ...
A new generic scheme for functional logic programming with constraints
2007
Higher-Order and Symbolic Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
CFLP(D) programs are presented as sets of constrained rewrite rules that define the behavior of possibly higher order and/or non-deterministic lazy functions over D. ...
As in the case of the well known CLP(D) scheme for Constraint Logic Programming, D is assumed to provide domain specific data values and constraints. ...
, and then selected the paper to be revised, extended, and submitted, to be considered for publication in a special issue of the Journal Higher-Order and Symbolic Computation (HOSC). ...
doi:10.1007/s10990-007-9002-4
fatcat:pxyinu26wjdwxfm5o5zacwhlhe
Constraint Functional Logic Programming Revisited
2005
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
CF LP (D) programs are presented as sets of constrained rewrite rules that define the behaviour of possibly higher order and/or non-deterministic lazy functions over D. ...
In this paper we propose a new generic scheme CF LP (D), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D. ...
In the last years, various extensions of CRW L have been devised, to account for various features of functional logic languages, such as higher order functions [37] , polymorphic types [38] , algebraic ...
doi:10.1016/j.entcs.2004.06.030
fatcat:ndnq5k2zi5f7jm6q5cnu4o26m4
Page 557 of Mathematical Reviews Vol. , Issue 2003A
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
program synthesis in a higher-order setting (87 100); Michael Leuschel and Helko Lehmann, Coverability of reset Petri nets and other well-structured transition systems by par- tial deduction (101-115); ...
Lopez-Fraguas and Jaime Sanchez-Hernandez, Proving failure in functional logic programs (179-193); An- nalisa Bossi, Sandro Etalle and Sabina Rossi, Semantics of input-consuming logic programs (194-208 ...
Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop
1993
DAIMI Report Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Sten Agerholm: Domain Theory in HOL The HOL system is an interactive proof-assistant system for conducting proofs in higher order logic. ...
Agerholm, "Domain theory in HOL," in Proceedings of the 1993 International Meeting on Higher Order Logic Theorem Proving and Its Applications, Vancouver Canada, 11-13 August 1993, Lecture Notes in Computer ...
doi:10.7146/dpb.v22i457.6930
fatcat:qqr3ybpuqrc3fmwjlsamx3kuwu
A Fully Sound Goal Solving Calculus for the Cooperation of Solvers in the CFLP Scheme
2007
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The CF LP scheme for Constraint Functional Logic Programming has instances CF LP (D) corresponding to different constraint domains D. ...
As a relevant concrete instance of our proposal, we consider the cooperation between Herbrand, real arithmetic and finite domain constraints. ...
In each case, we assume that G and G k (1 ≤ k ≤ l) are exactly as they appear in the presentation of the corresponding rule RL in Subsection 4.2. ...
doi:10.1016/j.entcs.2007.01.026
fatcat:bq47elkbirhgbcdgdemwjlikqq
Strategic directions in constraint programming
1996
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGMENTS We gratefully acknowledge the very valuable and timely comments from Thomas Fru ¨hwirth, John Hooker, Michael Maher, Catuscia Palamidessi, Peter Revesz, Mark Wallace, Peter van Beek, and ...
A number of works consider special constraint domains: integer-order constraints [Revesz 1993]; set constraints [Revesz 1995]; dense-order constraints [Grumbach and Su 1995] . ...
These classes justify the intuition that problems having large domains and higher arity constraints are generally harder. ...
doi:10.1145/242223.242279
fatcat:3aqe7rubijeddoahomxho2vtou
Page 9539 of Mathematical Reviews Vol. , Issue 2004k
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Symposium: Probability and Stochastic Processes, 7th Reynolds Number Scaling in Turbulent Flow, ['UTAM
Talca, 2002
Tallahassee, FL, 2002
Theorem proving in higher order logics ........... ...
Recent developments in cooperative control and optimization
Representations of finite dimensional algebras and related topics in Lie theory and geometry
Rings, modules, algebras, and abelian groups
* 62018 ...
Formal methods for the specification and design of real-time safety critical systems
1992
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Safety critical computers increasingly a ect nearly every aspect of our lives. Computers control the planes we y on, monitor our health in hospitals and do our work in hazardous environments. ...
Computers with software de ciencies that fail to meet stringent timing constraints have resulted in catastrophic failures. ...
LOGICS AND ALGEBRAS
LOGICS AND ALGEBRAS
LOGICS AND ALGEBRAS
LOGICS AND ALGEBRAS
LOGICS AND ALGEBRAS
LOGICS AND ALGEBRAS
LOGICS AND ALGEBRAS ...
doi:10.1016/0164-1212(92)90045-l
fatcat:zgh4zhmpjbbarecagzor3cxkh4
« Previous
Showing results 1 — 15 out of 7,477 results