CORSICA BUKU YANG BERKAIT DENGAN «SPECIALISER»
Ketahui penggunaan
specialiser dalam pilihan bibliografi berikut. Buku yang berkait dengan
specialiser dan ekstrak ringkas dari yang sama untuk menyediakan konteks penggunaannya dalam kesusasteraan Corsica.
1
Logic Program Synthesis and Transformation: 6th ...
In this perspective, we tried to combine our program specialiser with Mixtus [39],
a partial evaluator for full Prolog, and with SP [15], a system that is able to
specialise declarative logic programs, written in Prolog's syntax. In order to
evaluate the ...
2
Functional and Logic Programming: 7th International ...
History of Self-application for Logic Programming Not surprisingly, writing an
effectively self-applicable specialiser is a non-trivial task — the more features one
uses in writing the specialiser the more complex the specialisation process ...
Yukiyoshi Kameyama, Peter J. Stuckey,
2004
3
Perspectives of Systems Informatics: 5th International ...
In an offline specialiser almost all the control decisions are taken before the
actual specialisation phase in a preliminary analysis phase referred to as binding
-time analysis (BTA). Online partial evaluators typically do not make use of such a
...
Manfred Broy, Alexandre V. Zamulin,
2003
4
Proof and System-Reliability
This shows that a specialiser can compile. Correctness is to show that target is a
program in the specialiser's output language which is equivalent to S-program
src, i.e., [srcf = [[target]: JsrcJ (input) = Jint]](src. input) Definition of interpreter ...
Helmut Schwichtenberg, Ralf Steinbrüggen,
2002
5
Models and Computability
source, i.e., [[source]]s = [[target]]: [[sour<:e]]s(input) = |Iint]](source . input) Def 'n
of interpreter = [[[[spec]] (int . source)I](input) Def 'n of specialiser = [[target]](input)
Def 'n of target Second Futamura projection: comp = [[spec]](spec.int).
S. Barry Cooper, John K. Truss, Association for Symbolic Logic,
1999
6
Proof Technology and Computation
cialiser's output language which is equivalent to S-program src, i.e., src = target :
srcS(input) = int (src.input) Definition of interpreter = spec(int.src) (input)
Definition of specialiser = target (input) Definition of target Second Futamura
projection: ...
Helmut Schwichtenberg, Katharina Spies,
2006
7
Cattle Husbandry in Eastern Europe and China: Structure, ...
Scores ranked from 1 = very restricted to 7 = very easily available. Resources
diversifyin g f a r m e r s Independe n t diversifyin g f a r m e r s C ooperatin g W
a i t - a n d - s e e M o v e r s C ooperatin g specialiser s Independe n t specialiser
s C ...
Abele Kuipers, Andriy Rozstalnyy, Gerry Keane,
2013
8
Algebra, Meaning, and Computation: Essays Dedicated to ...
σT for σ a most general idempotent unifier of u and v, or failure at some stage, an
equation is reached for which no transition applies. Lemma 20 (Specialiser
Reduction) If specialisation by unification delivers m : ΠΔ .σT ⊣ s : ΠΔ. u ≃ v → T
then ...
Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer,
2006
9
Logic-Based Program Synthesis and Transformation: 9th ...
The quality of the specialised code depends on the user helping the specialiser (
e.g. providing invariants, helping the loop folder or helping the theorem prover).
Both prototypes above were implemented in Lisp. In [15] is described a partial ...
10
Logic-Based Program Synthesis and Transformation: 18th ...
However, the closest binding-time value is listnv, meaning that the BTA and the
specialiser would throw away the variable names (i.e., the specialiser will work
with [A/B,C/D] rather than with [x/B,y/D]). One solution is to improve our BTA to
work ...