APT, R. et al. Alma-0: An Imperative Language that Supports Declarative Programming. ACM Transactions on Programming Languages and Systems, New York, v.20, September 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....for v further on. This procedure is familiar from constraint programming. A source of inspiration for this move, and thus for the computational interpretation of dynamic first order logic is Alma 0, a hybrid language for imperative programming mixed with logic programming developed by Apt c.s. [2]. Identifying statements for v are identity statements of the form v = t or t = v. For computational purposes, states are partial functions V D, where V is the set of variables and D is the domain of the model that the computations are about. So suppose # is a state, and the computation ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 20:1014--1066, 1998. 17

....to the ; calculus (also shortly denoted calculus) the calculus where only syntactic matching is allowed (i.e. the theory T is assumed to be the trivial one) and we present the con uence properties of this calculus. We assume the reader familiar with the standard notions of term rewriting [16, 36, 4, 33] and with the basic notions of calculus [2] For the basic concepts about rule based constraint solving and deduction modulo, we refer respectively to [29, 37] and [14] 2 De nition of the T calculus We assume given in this section a theory T de ned equationally or by any other means. A ....

....the bound variables and some contextual information. Having new variables in the right hand side is just the ability to have free variables in the calculus. We will come back to this later but to support the intuition let us mention that the terms [2] and standard rst order rewrite rules [16, 4] are clearly objects of this calculus. For example, the term x: y x) corresponds to the term x [y] x) and a rewrite rule in rst order rewriting corresponds to the same rewrite rule in the rewriting calculus. We have chosen sets as the data structure for handling the potential ....

[Article contains additional citation context not shown here]

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 20:1014-1066, 1998.

....Language and how HoloJava, a compiler that translates Holo into Java, can be modi ed in order to support functional programming. KEYWORDS: Multiparadigm, Implementation of Functional Languages in Java. 1 Introduction In the last years the multiparadigm theme has been continually researched [2, 3, 5, 15, 23]. Researchers have proposed models of software development through the integration of basic paradigms (mainly: imperative, logic, functional, and object oriented paradigms) Using this approach, they have been looking for two goals: a) to overcome the speci c limitations of each paradigm and (b) ....

Apt, R. et al. Alma-0: An Imperative Language that Supports Declarative Programming. ACM Transactions on Programming Languages ans Systems, New York, v.20, September 1998.

.... the record that the rst of these points is addressed in [2] Apt and Bezem present their work as an underpinning for Alma 0, a language that infuses 32 Tableau Reasoning and Programming with Dynamic First Order Logic Modula style imperative programming with features from logic programming (see [4]) In a similar way, the present calculus provides logical underpinnings for Dynamo, a language for programming with an extension of DFOL. For a detailed comparison of Alma 0 and Dynamo we refer the reader to [13] Connection with WHILE, GCL It is easy to give an explicit binding semantics for ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 20:1014-1066, 1998.

.... for this are the dynamic variable binding strategies that have become fashionable in natural language analysis (DRT [8] Anaphora Logic [2] DPL [7] the idea of implementing identity assertions as assignment commands familiar from constraint programming, and more in particular from Alma 0 [1], and the general injunction to explore logical dynamics emanating from the works of Johan van Benthem, e.g. from [3] The standard dynamic interpretation of FOL, where 9x is interpreted as the action of random assignment of a new value to register x, is computationally unfeasible, because the ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998.

...., which itself gained much from the Z specification notation [13] and learned from UML OCL how not to do it) Contrary to ERA modelling, I do not distinguish between attributes and relations. In constraint programming, OPL [14] stands out as a medium level constraint modelling language, and ALMA [2] is also becoming a very powerful notation, on top of MODULA 2. Our ESRA shares with them the quest for a practical declarative modelling language based on a stronglytyped (full) first order logic with arrays (and with the look of an imperative language) while dispensing with such hardto ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. ALMA-0: An imperative language that supports declarative programming. ACM TOPLAS 20(5):1014--1066, 1998.

....never gives rise to an error condition. It should be noted for the record that the rst of these points is addressed in [Apt00] Apt and Bezem present their work as an underpinning for Alma 0, a language that infuses Modula style imperative programming with features from logic programming (see [ABPS98]) In a similar way, the present calculus provides logical underpinnings for Dynamo, a language for programming with an extension of DFOL. For a detailed comparison of Alma 0 and Dynamo we refer the reader to [Eij98] 13. Related Work 33 Comparison with tableau reasoning for FOL and for modal ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998.

....2 atoms never gives rise to an error condition. It should be noted for the record that the rst of these points is addressed in [2] Apt and Bezem present their work as an underpinning for Alma 0, a language that infuses Modula style imperative programming with features from logic programming (see [4]) In a similar way, the present calculus provides logical underpinnings for Dynamo, a language for programming with an extension of DFOL. For a detailed comparison of Alma 0 and Dynamo we refer the reader to [13] Connection with WHILE, GCL It is easy to give an explicit binding semantics for ....

Apt, K., Brunekreef, J., Partington, V., and Schaerf, A. Alma-0: An imperative language that supports declarative programming. ACM Toplas 20 (1998), 1014-1066.

.... Because our substitutions are total, in our calculus execution of t 1 : t 2 atoms never gives rise to an error condition. Apt and Bezem present their work as an underpinning for Alma 0, a language that infuses Modula style imperative programming with features from logic programming (see [ABPS98]) In a similar way, the present calculus provides logical underpinnings for Dynamo, a language for programming with an extension of DFOL. For a detailed comparison of Alma 0 and Dynamo we refer the reader to [Eij98] Comparison with tableau reasoning for FOL and for modal fragments of FOL The ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998.

....v : t for negations, and swaps v : t; 1 [ 2 ) 1 ; v : t [ 0 2 ; v : t, where 0 i is the result of pulling v : t through i , for unions. It follows from this that computations in AFOL can only yield nite sets of output valuations. DFOL Programming and Alma 0 Alma 0 [2] is a hybrid programming language that combines (Modula style) imperative programming with features of declarative programming like use of boolean expressions as statements and vice versa, and a construction to express don t know non determinism. Alma 0 does have no counterpart for the dynamic ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998.

....statement for v further on. This procedure is familiar from constraint programming. A source of inspiration for this move, and thus for the computational interpretation of dynamic FOL is Alma 0, a hybrid language for imperative programming mixed with logic programming developed by Apt c.s. [1]. Identifying statements for v are identity statements of the form v = t or t = v. For computational purposes, states are partial functions V D, where V is the set of variables and D is the domain of the model that the computations are about. So suppose ff is a state, and the computation ....

Krzysztof Apt, Jacob Brunekreef, Vincent Parrington, and Andrea Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, In press. Appeared as CWI Report in 1997, as PNA-R9713.

....identifying statement for x further on. This procedure is familiar from constraint programming. A source of inspiration for this move, and thus for the computational interpretation of FOL is Alma 0, a hybrid language for imperative programming mixed with logic programming developed by Apt c.s. [1]. We allow finite valuations as inputs and outputs of FOL formulas. Let Var be given. and let V be the set of variables fVar i j i 2 N g Let A : S X V N X , let ffl be the empty partial valuation (the only member of N ; and let ffl be an object not in A. Figure 1: Executable ....

Krzysztof Apt, Jacob Brunekreef, Vincent Parrington, and Andrea Schaerf. Alma-0: An imperative language that supports declarative programming. Technical Report PNA-R9713, CWI, 1997.

....identifying statement for x further on. This procedure is familiar from constraint programming. A source of inspiration for this move, and thus for the computational interpretation of FOL is Alma 0, a hybrid language for imperative programming mixed with logic programming developed by Apt c.s. [1]. We allow finite valuations as inputs and outputs of FOL formulas. Let Var be given. and let V be the set of variables fVar i j i 2 N g Let A : S X V N X , let ffl be the empty partial valuation (the only member of N ; and let ffl be an object not in A. If a 2 N X , for X V , ....

Krzysztof Apt, Jacob Brunekreef, Vincent Parrington, and Andrea Schaerf. Alma-0: An imperative language that supports declarative programming. Technical Report PNA-R9713, CWI, 1997.

....of a referent takes place by means of existential quantification, suitably reinterpreted as follows. The meaning of 9x becomes an action of random reset of the value of x. In other words, 9x changes an input variable state by resetting its x value to a random new value. Recent work by Apt c.s. [2, 1]) suggests a new variation on this theme. A first order signature is a triple (P; F; Ar) where P; F are disjoint finite sets of symbols (the relation and function symbols, respectively) and Ar is a function from P [ F to the natural numbers (the arity function) Let a first order signature and a ....

....(b; g b ; l b ) a; g a ; l a ) v i M: N OE Gamma (b; g b ; l b ) M a = m;N a = n; m j n Figure 4 gives the execution instructions for S v i M: N OE in transition system format. We can now reformulate (13) as (14) i [ 1: N OE: 14) Translating Alma 0 into L In [2], a hybrid programming language called Alma 0 is introduced, that combines features of imperative programming like destructive assignment with features of declarative programming like use of boolean expressions as statements and vice versa, and a construction to express don t know ....

[Article contains additional citation context not shown here]

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998. in press.

No context found.

K. R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM TOPLAS, 20(5):1014-1066, 1998.

....of the virtual machine on which programs are executed (section 5) and the semantics of the various language constructs (section 6) In a final section some concluding remarks are made. The language Alma 0 has been introduced by Apt Schaerf ( AS97] It is described in more detail in Apt et al. ABPS97] This paper also reports about a compiler for Alma 0. The compiler is described in more detail by Partington ( Par97] Information about Alma 0 can also be found on the Web at http: www.cwi.nl alma . 1.2 Alma 0 Alma 0 is an imperative language that supports backtracking. A program consists ....

....New parameter mechanism. In a procedure declaration a MIX parameter behaves like a VAR parameter if the actual parameter is a variable, otherwise it behaves like a value parameter. The following program fragments illustrate the use of the various Alma 0 constructs. More examples can be found in [ABPS97] I. Pattern matching. The following program counts the number of occurrences of a pattern p in a string s. Execution of the procedure StringMatch succeeds if there exists a match of p and a substring of s. With the FORALL statement, all occurrences of p in s are counted: after each execution of ....

K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. Technical Report PNA-R9713, Centrum voor Wiskunde en Informatica, Amsterdam, 1997. Submitted for publication elsewhere.

....extremely simple form of matching involving variables and ground terms only. However, the computation process now takes place over an arbitrary structure and full first order syntax is adopted. The formulas as programs approach to programming has been realized in the programming language Alma 0 [ABPS98] that extends imperative programming by features that support declarative programming. In fact, the work reported in Apt and Bezem [AB99] provided logical underpinnings for a fragment of Alma 0 that does not include destructive assignment or recursive procedures and allowed us to reason about ....

K. R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 20(5):1014--1066, 1998.

....even more radical than Local in the use of templates, so that the whole system is based on the use of templates, and inheritance is used only in a secondary way. 5. 4 Other Systems Constraint programming languages (cf. e.g. 15, 26] and specialized backtrackingbased programming languages (cf. [3]) are also tools for the solutions of combinatorial search problems, and they include generic solving techniques. Furthermore, some systems include specifically local search techniques (cf. e.g. 5] The difference of constraint based languages with respect to our work is that their built in ....

K. R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Transactions on Programming Languages and Systems, 20(5):1014--1066, 1998.

....when simulated using logic formulas. 1.2 Design Decisions These considerations have led us to a design of a programming language Alma 0. The initial work on the design of this language was reported in [3] the final description of the language, its implementation and semantics is presented in [2]. In a nutshell, Alma 0 has the following characteristics: it is an extension of a subset of Modula 2 that includes assignment, so it is a strongly typed imperative language; to record the initial value of a variable the equality can be used; it supports so called don t know ....

....very limited support for scoping and only one parameter mechanism is available. Let us return now to Alma 0. The language already provides a support for search by means of automatic backtracking. This support is further enhanced in our proposal by providing a built in constraint propagation. In [2] we stated that our language proposal should be viewed as an instance of a generic method for extending (essentially) any imperative programming language with facilities that encourage declarative programming. That is why we think that the proposal here discussed should be viewed not only as a ....

[Article contains additional citation context not shown here]

K. R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 20(5):1014--1066, 1998.

No context found.

APT, R. et al. Alma-0: An Imperative Language that Supports Declarative Programming. ACM Transactions on Programming Languages and Systems, New York, v.20, September 1998.

No context found.

K. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Transactions on Programming Languages and Systems, 20(5):1014-- 1066, 1998.

No context found.

Apt, K.R., Brunekreef, J., Partington, V., Schaerf, A.: Alma-0: An imperative language that supports declarative programming. ACM Toplas 20 (1998) 1014-- 1066

No context found.

K.R Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 1998. In press.

No context found.

K. R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 20(5):1014--1066, 1998.

No context found.

Krzysztof Apt, Jacob Brunekreef, Vincent Parrington, and Andrea Schaerf. Alma-0: An imperative language that supports declarative programming. Technical Report PNA-R9713, CWI, 1997.

First 50 documents

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