A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
A Foundation for Higher-order Concurrent Constraint Programming
[chapter]
1997
Mathematical Methods in Program Development
We present the -calculus, a computational calculus for higher-order concurrent programming. ...
A such extended -calculus has the remarkable property that it combines rst-order constraints with higher-order programming. ...
Martin Henz, Andreas Podelski, Ralf Treinen and J org W urtz helped by commenting on a draft version of this paper. ...
doi:10.1007/978-3-642-60858-2_24
fatcat:lcrw7h3norhefn3sgcj2jfvnca
Page 6674 of Mathematical Reviews Vol. , Issue 94k
[page]
1994
Mathematical Reviews
In this paper, we develop a
68 COMPUTER SCIENCE
6674
theory of higher-order computability suitable for comparing the expressiveness of sequential deterministic programming languages. ...
This paper sets out a framework for an axiomatic and denotational view of concurrent constraint programming, and considers the relationship of both views as an instance of Stone duality. ...
Book reports
1992
Computers and Mathematics with Applications
A new scheme for unification in WAM. 17. F.xtending the Warren abstract machine to polymorphic order-sorted resolution. IX. Non-classical logic, II. 18. Higher-order horn logic programming. 19. ...
True-concurrency in concurrent constraint programming. XIX. Invited talks. 44. Reasoning and programming: Analogies between logic and computation. 45. ...
doi:10.1016/0898-1221(92)90096-z
fatcat:4pjyhq2h5zcxzcjs7pzcgpop54
The habanero multicore software research project
2009
Proceeding of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications - OOPSLA '09
model consisting of a higher-level coordination language for domain experts and a lowerlevel parallel language for programming experts. ...
Multiple programming models are emerging to address an increased need for dynamic task parallelism in multicore sharedmemory multiprocessors. ...
We use the Concurrent Collections (CnC) programming model [9, 11, 4, 3] as the foundation for the higher-level coordination language in the Habanero project, and the Habanero Java (HJ) language as the ...
doi:10.1145/1639950.1639989
dblp:conf/oopsla/BarikBCCGPRSTYZS09
fatcat:jzuiikwixvgxfn7tovrrmj3gfy
Editorial
1992
Theoretical Computer Science
In "Unfolding and fixpoint semantics of concurrent constraint logic programs", M. Gabbrielli and G. Levi propose a semantics for a family of concurrent constraint logic languages. ...
This approach addresses a quite interesting integration of concurrent logic programming with constraint logic programming. ...
doi:10.1016/0304-3975(92)90283-l
fatcat:nb6jl2blyrfg3pkdq6yrch5wwi
Declarative concurrency in Java
[chapter]
2000
Lecture Notes in Computer Science
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. ...
Higher-level synchronization constraints on methods in a class may be de ned using these temporal constraints. The constraints are enforced by the run-time environment. ...
We are considering a mechanism that checks user constraints for cycles e.g., A B ; B A whenever a timeout occurred. ...
doi:10.1007/3-540-45591-4_43
fatcat:5mm73kvezrbp5ota2nthskopym
Memory Persistency: Semantics for Byte-Addressable Nonvolatile Memory Technologies
2015
IEEE Micro
We thank Aasheesh Kolli for assistance in formalizing our descriptions of persistency models and Ali Saidi for feedback on this work. ...
Our work lays a foundation for reasoning about the programming interface for a system that includes both volatile and nonvolatile memories. ...
Both models share a foundational axiom, strong persist atomicity, which we believe to be a key property to facilitate intuitive programming while enabling highly concurrent recoverable data structures. ...
doi:10.1109/mm.2015.46
fatcat:3ffdrwriobecdny5nbwwhnr2yu
Page 3869 of Mathematical Reviews Vol. , Issue 97F
[page]
1997
Mathematical Reviews
Stickel, Ordered binary decision dia- grams and the Davis-Putnam procedure (34-49); Gert Smolka, A foundation for higher-order concurrent constraint program- ming (50-72); Flemming Nielson and Hanne Riis ...
Nielson, Con- straints for polymorphic behaviours of concurrent ML (73-88); Joachim Niehren and Gert Smolka, A confluent relational calculus for higher-order programming with constraints (89-104); Zhenyu ...
Page 8069 of Mathematical Reviews Vol. , Issue 98M
[page]
1998
Mathematical Reviews
{For the entire collection see MR 98k:68005. }
98m:68036 68N17 03B35 03B70 68Q10 68Q55
Smolka, Gert (D-DFK12-PL; Saarbriicken)
A foundation for higher-order concurrent constraint programming. ...
Summary: “We present the y-calculus, a computational calculus for higher-order concurrent programming. ...
A history of the Oz multiparadigm language
2020
Proceedings of the ACM on Programming Languages (PACMPL)
This made Oz into the first concurrent and higher-order programming language that integrates Prolog-style problem solving. ...
A fourth, major advantage is that all higher-order functions become concurrency patterns; for example the FoldL function is the heart of a concurrent agent with internal state and the Map function combines ...
Furthermore, because of the deep integration of programming paradigms in Oz, ForCollect works correctly in a concurrent setting with streams, and it is also possible to write a version that creates a lazy ...
doi:10.1145/3386333
fatcat:sznttm7q3nhedfm5hcue7x76di
Page 4567 of Mathematical Reviews Vol. , Issue 98G
[page]
1998
Mathematical Reviews
(NL-UTRE-C; Utrecht); Gabbrielli, Maurizio (1-PISA-IF; Pisa) Infinite computations in concurrent constraint programming. ...
Summary: “We present a fully abstract model for concurrent constraint programming which besides describing the results of terminating computations also describes the results of those non- terminating computations ...
Page 6500 of Mathematical Reviews Vol. , Issue 98J
[page]
1998
Mathematical Reviews
A logic programming presentation of all of higher-order linear logic, named Forum, modularly extends these other languages and also allows for abstractions and con- currency in specifications. ...
Two such languages, lambda Prolog and its linear logic refinement, Lolli, provide for various forms of abstraction (mod- ules, abstract data types, and higher-order programming) but lack primitives for ...
A Concurrent Operational Semantics for Constraint Functional Logic Programming
2012
International Conference on Logic Programming
We encode concurrency into the generic CFLP(D) scheme, a uniform foundation for the operational semantics of constraint functional logic programming systems parameterized by a constraint solver over the ...
In this paper we describe a sound and complete concurrent operational semantics for constraint functional logic programming languages which allows to model declarative applications in which the interaction ...
for concurrent functional and constraint logic programming. ...
doi:10.4230/lipics.iclp.2012.154
dblp:conf/iclp/VirsedaMT12
fatcat:tymooafwuvdmpdprheqiihrk3y
Logic programming in the context of multiparadigm programming: the Oz experience
[article]
2002
arXiv
pre-print
Instead of Horn clause syntax, Oz has a simple, fully compositional, higher-order syntax that accommodates the abilities of the language. ...
A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease. ...
Higher-order logic programming. Vol. 5 of (Gabbay et al., 1995) . Chap. 8. Nikhil, Rishiyur S. 1994a (July). ID language reference manual version 90.1. Tech. rept. Memo 284-2. ...
arXiv:cs/0208029v1
fatcat:aef4drwtkfd4tcyknziqfegbja
Page 3458 of Mathematical Reviews Vol. , Issue 99e
[page]
1999
Mathematical Reviews
Summary: “In order to characterize certain formal languages cap- turing some syntactic aspects of higher programming languages we introduce automata with the storage type ‘set’, called set automata. ...
“A generic programming language is defined for real-time, con- current programs and a structured operational semantics for the language. ...
« Previous
Showing results 1 — 15 out of 60,631 results