Available at http:##haskell.org#. #67# S.L. Peyton Jones and J. Launchbury. State in haskell. Lisp and Symbolic Computation, 8#4#:293#341, December 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....exploit the key uniqueness constraint and one has to resort to standard bulk iteration constructs: for each p in persons: p.name = Peter do p.age: p. age 1 end Associative set and element selection is also a basis for logic and constraint based programming languages like LDL [NT89] or Life [AKN89] person(Name, Age) Age 60. person( Peter , PetersAge) It should be emphasized that in the above discussion on mutability, copy vs. reference semantics, the handling of constraint violations or basic iteration facilities, we do not argue in favour of a specific solution. On the ....

H. At-Kaci and R. Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

....if an equation involves a functional expression whose arguments are not sufciently instantiated to match a deniens of the function in question, it is simply left untouched. Resolution may proceed until the arguments are proven to match a denition from the accumulated constraints in the context [3]. This simple idea turns out invaluable in practice. This technique delaying reduction and enforcing determinism by allowing only equivalence reductions is called residuation [3] It does not have to be limited to functions. Therefore, we explain it for the general case of relations. Intuitively, ....

....may proceed until the arguments are proven to match a denition from the accumulated constraints in the context [3] This simple idea turns out invaluable in practice. This technique delaying reduction and enforcing determinism by allowing only equivalence reductions is called residuation [3]. It does not have to be limited to functions. Therefore, we explain it for the general case of relations. Intuitively, the arguments of a relation which are constrained by the guard are its input parameters and correspond to the arguments of a function. This has been used as an implicit control ....

Hassan At-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51-89 (1989).

....an equation involves a functional expression whose arguments are not sufficiently instantiated to match a definiens of the function in question, it is simply left untouched. Resolution may proceed until the arguments are proven to match a definition from the accumulated constraints in the context [4]. This simple idea turns out invaluable in practice. Here are a few benefits. ffl Such non declarative heresies as the is predicate in Prolog and the freeze meta predicate in some of its extensions [21, 12] are not needed. ffl Functional computations are determinate and do not incur the overhead ....

Hassan At-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89 (1989).

....They originated in the late seventies with so called unification grammars [16, 13] a by now popular family of declarative grammar formalisms for the description and processing of natural language. More recently, the use of feature descriptions in logic programming has been advocated and studied [3, 4, 5, 6, 23]. Essentially, feature descriptions provide a logical version of records, a data structure found in many programming languages. Feature descriptions have been proposed in various forms with various formalizations [1, 2, 15, 20, 14, 11, 12, 22, 7, 8, 19] We will follow the logical approach ....

Hassan Ait-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

....of LIFE [3] There, they are also used to represent functions whose arguments are OSF patterns and which can appear as bona fide terms in relational constraints. Normalization of thus extended OSF structures must also reduce function application wherever a redex appears in a constraint formula [6, 5]. However, an OSF functional redex is such that the formal argument (the pattern) as well as the actual argument are codified as OSF formulae. What corresponds to pattern matching must now be decided as constraint entailment between OSF formulae (or, equivalently, as endomorphic approximation ....

Hassan Ait-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

....through entailment simplification. One origin of FT is At Kaci s term calculus [1] which is at the heart of the programming language LOGIN [2] and further extended in the language LIFE [4] with functions over feature structures thanks to a generalization of the concept of residuation of Le Fun [3]. Other precursors of FT are the feature descriptions found in so called unification grammars [12, 11] developed for natural language processing, and also the formalisms of Mukai [16, 17] These early feature structure formalism were presented in a nonlogical form. Major steps in the process of ....

H. At-Kaci and R. Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

....strategy of the Andorra model [10, 11] with the difference that residuation performs indeterminate reduction only on atoms whose relation is explicitly declared as generating. The philosophy behind residuation is that for most relations 1 The term residuation was coined by Hassan At Kaci [1, 3, 2] for delaying control schemes. Research Report No. 12 June 2 Gert Smolka indeterminate reduction simply does not make sense, and that complex answers are often appropriate. In the examples of this paper, we will assume a constraint system with trees and linear integer arithmetic. A length ....

Hassan At-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89 (1989).

....an equation involves a functional expression whose arguments are not sufficiently instantiated to match a definiens of the function in question, it is simply left untouched. Resolution may proceed until the arguments are proven to match a definition from the accumulated constraints in the context [4]. This simple idea turns out invaluable in practice. Here are a few benefits. ffl Such non declarative heresies as the is predicate in Prolog and the freeze meta predicate in some of its extensions [21, 12] are not needed. ffl Functional computations are determinate and do not incur the overhead ....

Hassan At-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89 (1989).

....immediat ni plus ancien, ce ne sont pas les elements qui determinent l ensemble, mais l ensemble qui determine les elements. GEORGES PEREC La vie, mode d emploi. 1 1 Introduction LIFE is a programming language originally conceived by Hassan At Kaci and his colleagues at MCC, in Austin, Texas [4, 5, 3]. It is a synthesis of three different programming paradigms: logic programming, functional programming and object oriented programming. 2 LIFE is a declarative logic based language that can be seen as a constraint language. It derives its syntax and resolution method from Prolog. Except for ....

....list. The following execution fragment shows how to couple the function map with residuation. 13 A calculus handling currying with named arguments and consumption by position is presented in [2] March 1994 Digital PRL Wild LIFE Handbook 25 fact(0) 1. fact(N) N fact(N 1) R=map(F,[4,5,6,7]) Yes F = R = 1 F=fact Yes F = fact, R = 24,120,720,5040] Example 6.12 This example defines a function with two rules where each rule has an argument with a different label. The function will curry if arguments are missing relative to the rule being matched against. ....

[Article contains additional citation context not shown here]

Hassan At-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89 (1989).

....by so called object oriented languages. For example, referring back to Figure 3 on Page 6, the function: age(person(dob ) date(year ) X) ThisYear : integer) ThisYear Gamma X: will apply generically to all subtypes and instances of persons with a birth year. 3. 3 Calculus: Le Fun Le Fun [AKLN87, AKN89] is a relational and functional programming language where first order terms are generalized by the inclusion of applicative expressions as defined by Landin [Lan63] atoms, abstractions, and applications) augmented with first order constructor terms. Thus, interpreted functional expressions may ....

Hassan At-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

....an equation involves a functional expression whose arguments are not sufficiently instantiated to match a definiens of the function in question, it is simply left untouched. Resolution may proceed until the arguments are proven to match a definition from the accumulated constraints in the context [3]. This simple idea turns out invaluable in practice. This technique delaying reduction and enforcing determinism by allowing only equivalence reductions is called residuation [3] It does not have to be limited to functions. Therefore, we explain it for the general case of relations. ....

....may proceed until the arguments are proven to match a definition from the accumulated constraints in the context [3] This simple idea turns out invaluable in practice. This technique delaying reduction and enforcing determinism by allowing only equivalence reductions is called residuation [3]. It does not have to be limited to functions. Therefore, we explain it for the general case of relations. Intuitively, the arguments of a relation which are constrained by the guard are its input parameters and correspond to the arguments of a function. This has been used as an implicit control ....

Hassan Ait-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89 (1989).

....simplification system for entailment. One origin of FT is At Kaci s term calculus [1] which is at the heart of the programming language LOGIN [3] and further extended in the language LIFE [5] with functions over feature structures thanks to a generalization of the concept of residuation of Le Fun [4]. 1 Other precursors of FT are the feature descriptions found in unification grammars [15, 14] developed for natural language processing, and also the formalisms of Mukai [19, 20] for a thorough survey of precursors in this field, cf. 8] These early feature structure formalisms were ....

....LIFE. The paper is organized as follows. Section 2 defines the basic notions and discusses the differences in expressivity between Herbrand and FT. Section 3 gives a basic simplification system that decides satisfiability of positive constraints. The material of Section 4 is not limited 1 Le Fun [4] is an extension of Prolog seen as a constraint logic programming system over Herbrand terms extended with applicative expressions. Le Fun s constraint solver achieves implicit coroutining thanks to an automatic suspension mechanism called residuation delaying equations with unsufficiently ....

[Article contains additional citation context not shown here]

H. At-Kaci and R. Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

....we have in mind. Our key insight is based on our having understood that most attractive programming paradigms introduced recently in declarative symbolic programming languages need not be provided at the detriment of one another. This fact is clearly demonstrated and amply illustrated in [AKN86, AKN89, AK91a, AKP91b, AKP91a, AKM90] More importantly, they need not preclude the more conventional state effecting style of explicit control and data processing of imperative programming [FF89, Fel87] Therefore, we believe that it is quite feasible to set up a concrete and rigorous design plan based ....

....is done incrementally and asynchronously. This is achieved by seeing constraint solving as a non deterministic normalisation process over formulae involving existential variables. Variable valuations are thus computed declaratively with a mechanism of suspended constraints as closures [AKN89, AKP91a] Hence, given a representation of objects as feature structures interpreted as partial approximations (see Fig. 1) a network of asynchronous constraints is established by representing constraints as closures (see Fig. 2) For monotonic side effects, objects in the network are preserved ....

Hassan At-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

....simplification system for entailment. One origin of FT is At Kaci s term calculus [1] which is at the heart of the programming language LOGIN [3] and further extended in the language LIFE [5] with functions over feature structures thanks to a generalization of the concept of residuation of Le Fun [4]. 1 Other precursors of FT are the feature descriptions found in unification grammars [15, 14] developed for natural language processing, and also the formalisms of Mukai [19, 20] for a thorough survey of precursors in this field, cf. 8] These early feature structure formalisms were ....

.... are the articles [22, 25, 13, 24] Feature trees, the feature tree structure T , and the axiomatization of T were first given in [7] The technique of relative simplification of constraints was first introduced and used in [6] to explain the behavior of functions as passive 1 Le Fun [4] is an extension of Prolog seen as a constraint logic programming system over Herbrand terms extended with applicative expressions. Le Fun s constraint solver achieves implicit coroutining thanks to an automatic suspensionmechanism called residuation delaying equations with unsufficiently ....

[Article contains additional citation context not shown here]

H. At-Kaci and R. Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

No context found.

Available at http:##haskell.org#. #67# S.L. Peyton Jones and J. Launchbury. State in haskell. Lisp and Symbolic Computation, 8#4#:293#341, December 1995.

No context found.

Hassan Ait-Kaci and Roger Nasr. Integrating logic and functional programming. Lisp and Symbolic Computation, 2:51--89, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC