Results 1 - 10 of 770

Higher-order chemistry

by Jean-pierre Banâtre, Pascal Fradet, Yann Radenac - in « Preproceedings of the Workshop on Membrane Computing , 2003
"... Gamma is a formalism in which programs are expressed in terms of multiset rewriting often referred as the Chemical Reaction Model. In this paper we are concerned with higher-order Gamma programming. First we review three proposals which introduce the notion of membrane and higher order facilities. F ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Gamma is a formalism in which programs are expressed in terms of multiset rewriting often referred as the Chemical Reaction Model. In this paper we are concerned with higher-order Gamma programming. First we review three proposals which introduce the notion of membrane and higher order facilities

Reliable Communication in the Presence of Failures

by Kenneth P. Birman, Thomas A. Joseph - ACM Transactions on Computer Systems , 1987
"... The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols at ..."
Abstract - Cited by 546 (18 self) - Add to MetaCart
alternative to conventional asynchronous communication protocols. The facility also ensures that the processes belonging to a fault-tolerant process group will observe consistent orderings of events affecting the group as a whole, including process failures, recoveries, migration, and dynamic changes to group

Polymorphic Higher-Order Programming in Prolog

by unknown authors
"... Abstract Pure logic programming lacks some features known from other modern programming languages, e.g., type systems for detection of particular programming errors at compile time and higher-order facilities for treating programs as data objects and writing more compact programs. On the one hand th ..."
Abstract - Add to MetaCart
Abstract Pure logic programming lacks some features known from other modern programming languages, e.g., type systems for detection of particular programming errors at compile time and higher-order facilities for treating programs as data objects and writing more compact programs. On the one hand

for Higher-Order Procedural Variables

by Tristan Crolard, Emmanuel Polonowski, T. Crolard, E. Polonowski , 2009
"... We formally specified the type system and operational semantics of Loop ω with Ott and Isabelle/HOL proof assistant. Moreover, both the type system and the semantics of Loop ω have been tested using Isabelle/HOL program extraction facility for inductively defined relations. In particular, the progra ..."
Abstract - Add to MetaCart
We formally specified the type system and operational semantics of Loop ω with Ott and Isabelle/HOL proof assistant. Moreover, both the type system and the semantics of Loop ω have been tested using Isabelle/HOL program extraction facility for inductively defined relations. In particular

Function definition in higher-order logic

by Konrad Slind - IN THEOREM PROVING IN HIGHER-ORDER LOGICS. 9TH INTERNATIONAL CONFERENCE, TPHOLS '96. SPRINGER-VERLAG LNCS , 1996
"... We use a formally proven wellfounded recursion theorem as the basis upon which to build a function definition facility for Higher Order Logic. This approach offers flexibility in the choice of wellfounded relations used, the deferral of termination arguments, and automatic isolation of termination ..."
Abstract - Cited by 19 (0 self) - Add to MetaCart
We use a formally proven wellfounded recursion theorem as the basis upon which to build a function definition facility for Higher Order Logic. This approach offers flexibility in the choice of wellfounded relations used, the deferral of termination arguments, and automatic isolation

Reasoning about Higher-Order Processes

by Roberto M. Amadio, Mads Dam, Crin-inria Nancy , 1994
"... We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple ..."
Abstract - Cited by 21 (8 self) - Add to MetaCart
. Keywords: Higher-order process calculi; Bisimulation; Modal logics; Program specification; Program verif...

The Revised Report on the Syntactic Theories of Sequential Control and State

by Matthias Felleisen, Robert Hieb - THEORETICAL COMPUTER SCIENCE , 1992
"... The syntactic theories of control and state are conservative extensions of the v -calculus for equational reasoning about imperative programming facilities in higher-order languages. Unlike the simple v -calculus, the extended theories are mixtures of equivalence relations and compatible congruen ..."
Abstract - Cited by 292 (36 self) - Add to MetaCart
The syntactic theories of control and state are conservative extensions of the v -calculus for equational reasoning about imperative programming facilities in higher-order languages. Unlike the simple v -calculus, the extended theories are mixtures of equivalence relations and compatible

Evolutionary Higher-Order Concept Learning

by Claire Kennedy - Stanford University Bookstore , 1998
"... Current concept learners are limited in their applicability as they generally rely on comparatively poor knowledge representation facilities (e.g. attribute value pairs, flattened horn clauses). The work carried out in support of my thesis has involved extending concept learning to a higher order se ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
languages to provide a facility for learning in a higher-order context. While induction in t...

Higher-order Aspects of Logic Programming

by Uday S. Reddy
"... Abstract. Are higher-order extensions to logic programming needed? We answer this question in the negative by showing that higher-order features are already available in pure logic programming. It is demonstrated that higher-order lambda calculus-based languages can be compositionally embedded in lo ..."
Abstract - Add to MetaCart
in logic programming languages preserving their semantics and abstraction facilities. Further, we show that such higherorder techniques correspond to programming techniques often practiced in logic programming. Keywords: Higher-order features, functional programming, lambda calculus, logic variables

Evolutionary Higher-Order Concept Learning

by Claire Kennedy Department , 1998
"... Current concept learners are limited in their applicability as they generally rely on comparatively poor knowledge representation facilities (e.g. attribute value pairs, flattened horn clauses). The work carried out in support of my thesis has involved extending concept learning to a higher order se ..."
Abstract - Add to MetaCart
Current concept learners are limited in their applicability as they generally rely on comparatively poor knowledge representation facilities (e.g. attribute value pairs, flattened horn clauses). The work carried out in support of my thesis has involved extending concept learning to a higher order
Results 1 - 10 of 770