Results 1 
3 of
3
MALI v06  Tutorial and Reference Manual
, 1991
"... MALIv06 is an implementation of the abstract data type "stack of mutable firstorder terms". It allows for an efficient memory management of the runtime data structures of logic programming systems. The documentation of MALIv06 is made of a tutorial and a reference manual. The tutorial introduc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
MALIv06 is an implementation of the abstract data type "stack of mutable firstorder terms". It allows for an efficient memory management of the runtime data structures of logic programming systems. The documentation of MALIv06 is made of a tutorial and a reference manual. The tutorial introduces a target machine for the compilation of Prolog as a pedagogical application. The reference manual gives the specification of MALIv06. Appendices contain discussions on MALIv06. This document may be subject to changes both in form and in content. Comments are welcome. MALI v06  Tutoriel et manuel de r'ef'erence R'esum'e  MALIv06 est une impl'ementation du type abstrait "pile de termes modifiables". Elle offre une gestion de m'emoire efficace pour les structures de donn'ees des syst`emes de programmation logique. La documentation de MALIv06 comprend un tutoriel et un manuel de r'ef'erence. Le tutoriel pr'esente en guise d'application p'edagogique une machine cible pour la...
Prolog/Mali Reference Manual
"... ion is a kind of quantification: the quantification. It has strong connections with universal quantification which are developed in the sequel. As a quantification, abstraction gives rise to the usual notions of free and bound variables. ffl If E and F are in L, then (E F ) is an application in L ..."
Abstract
 Add to MetaCart
ion is a kind of quantification: the quantification. It has strong connections with universal quantification which are developed in the sequel. As a quantification, abstraction gives rise to the usual notions of free and bound variables. ffl If E and F are in L, then (E F ) is an application in L. Application is supposed to associate to the left so that nested applications (: : : ((a 1 a 2 ) a 3 ) : : : an ) are written (a 1 a 2 a 3 : : : an ), (a n ), or (a) if the number of individuals does not matter 3 . ffl There is a typing function from L to T that satisfies rules (x:E) = (x) ! (E) and 9ff: ( (E) = ff ! fi) ( (F ) = ff) , ((E F )) = fi A constant that is given a predicate type is called a predicate constant. Example 1.2.2 A term x:E with type ff ! fi can be interpreted as a function with parameter x of type ff and result E of type fi. For instance, x:x with type ff ! ff is the identity function for terms having type ff. It is noted id ff . Concrete syntax for x:x ...
The Compilation of λProlog and its Execution with MALI
, 1993
"... We present a compiled implementation of λProlog that uses the abstract memory MALI for representing the execution state. λProlog is a logic programming language allowing a more general clause form than Standard Prolog's (namely hereditary Harrop formulas instead of Horn formulas) and using simply ty ..."
Abstract
 Add to MetaCart
We present a compiled implementation of λProlog that uses the abstract memory MALI for representing the execution state. λProlog is a logic programming language allowing a more general clause form than Standard Prolog's (namely hereditary Harrop formulas instead of Horn formulas) and using simply typed λterms as a term domain instead of first order terms. The augmented clause form causes the program (a set of clauses) and the signature (a set of constants) to be changeable in a very disciplined way. The new term domain has a semidecidable and infinitary unification theory, and it introduces the need for a fireduction operation at runtime. MALI is an abstract memory that is suitable for storing the searchstate of depthfirst search processes. Its main feature is its efficient memory management. We have used an original λPrologtoC translation along which predicates are transformed into functions operating on continuations for handling failure and success in unifications, and change...