
	Where results make sense

Topic: Warren Abstract Machine

Related Topics

September 9th

HQ9 Plus

Open Bible Standard Churches

Alloy language

De Plancy

Edward Leedskalnin

Yusuke Iseya

WCVO

Melbourne CBD

Pearl and Hermes Reef

Gaston Caperton

San Juan River

Fakhruddin Ali Ahmed

Zhengde Emperor of China

Vilppula

	Warren Abstract Machine - Wikipedia, the free encyclopedia
		In 1983, David H. Warren designed an abstract machine for the execution of Prolog consisting of a memory architecture and an instruction set [War83].
		This design became known as the Warren Abstract Machine (WAM) and has become the de facto standard target for Prolog compilers.
		In [War83], Warren describes the WAM in a minimalist's style, making understanding very difficult for the average reader, even with a foreknowledge of Prolog's operations.
	en.wikipedia.org /wiki/Warren_Abstract_Machine (203 words)

	Abstract machine - Wikipedia, the free encyclopedia
		Abstract machines are often used in thought experiments regarding computability or to analyze the complexity of algorithms (see computational complexity theory).
		A typical abstract machine consists of a definition in terms of input, output, and the set of allowable operations used to turn the former into the latter.
		An abstract machine can also refer to a microprocessor design which has yet to be (or is not intended to be) implemented as hardware.
	en.wikipedia.org /wiki/Abstract_machine (272 words)

	ISO-PROLOG and the Warren Abstract Machine
		WAM and a proven to be correct general scheme for constructing compilers from Prolog to Warren Abstract Machine code.
		PAM(see abstract), developed at IBM Germany, where the abstract types are refined by polymorphic order-sorted types, as they appear in Protos-L, and implemented in the WAM extension
		Kwon's machine which permits procedure definitions to be given a scope.
	www.di.unipi.it /~boerger/prologwam.html (193 words)

	Abstract State Machines: Warren Abstract Machine (Site not responding. Last check: 2007-09-06)
		Based on the approach used in the WAM and PAM papers, a corresponding generic compilation scheme of CLP(X) programs to WAM(X) code is developed, obtaining also a mathematical correctness proof of the design.
		An extension of the ASM for the WAM to a full specification and correctness proof of PROTOS-L and the PROTOS Abstract Machine (PAM).
		A specification and proof of correctness for the Prolog Distributed Processor (PDP), a WAM extension for parallel execution of Prolog on distributed memory.
	www.uni-paderborn.de /cs/asm/Available_Materials/wam.html (411 words)

	New Models (Site not responding. Last check: 2007-09-06)
		While many implementations are based on the Warren Abstract Machine, or at least on models directly derived from this design, in recent years some novel execution models have been proposed, which substantially differ from the WAM.
		The fact that the abstract machine has been specialized to binary programs allowed to considerably reduce the number of instructions required and facilitated the introduction of a wide variety of optimizations.
		In particular, Krall's observation is that one of the main sources of inefficiency in the WAM is represented by the separation between the phase in which the arguments of a subgoal are prepared and the phase in which head unification is performed.
	www.cs.nmsu.edu /~epontell/adventure/node37.html (320 words)

	Warren's Abstract Machine (Site not responding. Last check: 2007-09-06)
		If you retrieve it, all I ask is that you let me know who you are, and for what purpose you intend to use it.
		Here is also a set of transparencies that I used for my lectures on the WAM at the International Conference on Logic Programming (1991, Paris, France).
		I claim sole copyrights of these, and request that you kindly inform me if you download them.
	www.vanx.org /archive/wam/wam.html (191 words)

	The Algernon Abstract Machine (ResearchIndex) (Site not responding. Last check: 2007-09-06)
		Abstract: This report describes the Algernon Abstract Machine, an execution environment for accesslimited logic programs.
		Like the Warren Abstract Machine for Prolog, the Algernon Abstract Machine (AAM) consists of an assembly-level language and a set of registers on which the language instructions operate.
		The AAM has a well-defined interface to a knowledge base, enabling it to be used in conjunction with any frame-based knowledge base.
	citeseer.ist.psu.edu /hewett00algernon.html (400 words)

	OhioLINK ETD: Chen, Pu
		Logic programs, which are represented by well motivated logical formalisms, can be viewed operationally as the execution of an abstract computation model on a logical theory, guided by some control information supplied with the theory.
		In such a hierarchy, the uppermost layer is an abstract execution model developed to support the computation of logic programs.
		An abstract machine is at the bottom of the hierarchy to support the process network model.
	www.ohiolink.edu /etd/view.cgi?case1061906762 (453 words)

	Abstract Machines (Site not responding. Last check: 2007-09-06)
		An abstract machine is a semantic model of a programming language, specified by how each piece of the language's notation would be translated into the abstract machine's code.
		This is to do with the use of abstract machines to identify generic operations by examining the patterns of abstract machine operations for particular application areas (particularly CBR in this project).
		This is an attempt to classify abstract machines according to their degree of abstraction.
	www.cs.york.ac.uk /linda/CHALK/AIKMS97/absmach.html (259 words)

	A Verified Prolog Compiler for the Warren Abstract Machine - Russinoff (ResearchIndex) (Site not responding. Last check: 2007-09-06)
		Abstract: Machine David M. Russinoff Microelectronics and Computer Technology Corporation 3500 West Balcones Center Drive Austin, TX 78759 (512) 338-3583 Abstract We extend the theory of Prolog to provide a framework for the study of Prolog compilation technology.
		For this purpose, we first demonstrate the semantic equivalence of two Prolog interpreters: a conventional SLD-refutation procedure and one that employs Warren's "last call" optimization.
		2 A Tutorial on the Warren Abstract Machine (context) - Gabriel, Lindholm et al.
	citeseer.ist.psu.edu /russinoff92verified.html (487 words)

	[No title]
		For machines with dynamic stack allocation this flag sets the maximum value to which the stack is allowed to grow (2 Mbytes default).
		For machines with dynamic stack allocation the default is 4 Mbytes.
		On machines with dynamic stack allocation the stacks are not written to file and so their size does not matter.
	aurora.rg.iupui.edu /doc/PLDOC (17362 words)

	[No title]
		A rule base is a set of Horn clauses, and inference engine works according to WAM (Warren Abstract Machine).
		Structure and function of supervisory system Supervisory system is conceptualised as a knowledge system consisting of a rule base, working memory for collecting temporal facts, an inference engine and communication interfaces with sensor and effectors of the action object, [1].
		Prior to building ontology of machine operation supervisory system, we have to create hierarchy of categories of processing objects, processors and processes.
	www.sweb.cz /Josef.Posta/KONF/Kusz.doc (1004 words)

	Abstract of PLILP'90 (Site not responding. Last check: 2007-09-06)
		This paper proposes a technique for compiling programs with these inference rules into programs of a low-level abstract machine which can be efficiently executed on conventional architectures.
		The presented approach is based on an extension of the Warren abstract machine (WAM).
		In order to obtain an efficient implementation of functional computations, a stack of occurrences of function symbols in goals is managed by the abstract machine.
	www.informatik.uni-kiel.de /~mh/publications/papers/PLILP90.html (178 words)

	abstract machine - OneLook Dictionary Search
		Tip: Click on the first link on a line below to go directly to a page where "abstract machine" is defined.
		abstract machine : FOLDOP - Free On Line Dictionary Of Philosophy [home, info]
		Phrases that include abstract machine: abstract machine notation, categorical abstract machine language, warren abstract machine
	www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=abstract+machine (120 words)

	DAI Database: MSc Thesis #9715 (Site not responding. Last check: 2007-09-06)
		Most implementations of the Warren Abstract Machine to convert Prolog to native code have been C and stack-based.
		At present there does not seem to be an efficient, easily-extensible implementation of the WAM in Java.
		This paper first presents a tutorial of WAM behavior from a persepctive not tied to a stack-based implementation.
	www.dai.ed.ac.uk /papers/documents/mt9715.html (130 words)

	[No title] (Site not responding. Last check: 2007-09-06)
		The PLM was a microcoded implementation of the Warren Abstract Machine, a formal model for the execution of Prolog programs.
		The next step, the Berkeley Abstract Machine (BAM), was designed to support optimization of programs by the compiler, and achieved higher performance than the PLM by a factor of ten.
		The ultimate goal of the project is to determine the principles of computer architecture that will enable the design of new, revolutionary embedded microcomputers, which will have a rapid response to real-time events, as well as low power consumption.
	www.isi.edu /acal/slam/tmp (152 words)

	Warren Abstract Machine (WAM) (Site not responding. Last check: 2007-09-06)
		Cecchi, Corrado Moiso: An Extension of WAM for K-LEAF: A WAM-based Compilation of Conditional Narrowing.
		Christoph Beierle, Gregor Meyer, Heiner Semle: Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution.
		Daniel Diaz, Philippe Codognet: A Minimal Extension of the WAM for clp(FD).
	www.informatik.uni-trier.de /~ley/db/prolog/wam.html (104 words)

	Abstract of PLILP'90 article (Site not responding. Last check: 2007-09-06)
		The Vienna Abstract Machine (VAM) is a Prolog machine developed at the TU Wien.
		In contrast to the standard implementation technique (Warren Abstract Machine - WAM), an inference in VAM is performed by unifying the goal and head immediately, instead of bypassing arguments through a register interface.
		In this paper we present the VAM in detail and compare it with existing machines.
	www.complang.tuwien.ac.at /~andi/plilp90.html (183 words)

	Abstracts of Iliano Cervesato's papers (Site not responding. Last check: 2007-09-06)
		Commercial implementations of logic programming languages are engineered around a compiler based on Warren's Abstract Machine (WAM) or a variant of it.
		In spite of various correctness proofs, the logical machinery relating the proof-theoretic specification of a logic programming language and its compiled form is still poorly understood.
		We apply this methodology to derive the first cut of a compiler and the corresponding abstract machine for the language of hereditary Harrop formulas and then for its linear refinement.
	theory.stanford.edu /~iliano/abstracts/jicslp98.html (123 words)

	[No title]
		The restrictions of access limitation are handled by the compiler, so the abstract machine itself can execute general-purpose forward and backward chaining rules.
		Building a system around an abstract machine has several advantages, including enhancing the portability of user-level code to different execution environments.
		This has been apparent in the success of Prolog (using the Warren Abstract Machine) and Java (using the Java Virtual Machine).
	www.cs.utexas.edu /ftp/pub/AI-Lab/index/index-2000 (418 words)

	References (Site not responding. Last check: 2007-09-06)
		Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
		The Abstract Machine and Implementation of Parallel Prolog.
		A tutorial on the warren abstract machine for computational logic.
	www.cs.nmsu.edu /~epontell/adventure/node60.html (1133 words)

	ACM TOPLAS (Site not responding. Last check: 2007-09-06)
		In the Warren Abstract Machine (WAM), the most widely used abstract machine for Prolog implementation, arguments are passed through argument registers, and the information associated with procedure calls is stored in possibly two frames.
		The ATOAM differs from the WAM mainly in that (1) arguments are passed directly into stack frames, (2) only one frame is used for each procedure call, and (3) procedures are translated into matching trees if possible, and clauses in each procedure are indexed on all input arguments.
		The above-mentioned inefficiencies of the WAM do not exist in the ATOAM because backtracking requires less bookkeeping operations, and tail recursion can be handled in most cases like a loop statement in procedural languages.
	www.sci.brooklyn.cuny.edu /~zhou/papers/toplas96.html (289 words)

	Abstract of PDK'91 (Site not responding. Last check: 2007-09-06)
		The operational semantics of the language consists of resolution to solve predicates and narrowing and rewriting to evaluate functional expressions.
		The implementation is based on an extension of the Warren Abstract Machine (WAM).
		This extension causes no overhead for pure logic programs and allows the execution of functional programs by narrowing and rewriting with the same efficiency as their relational equivalents.
	www.informatik.uni-kiel.de /~mh/publications/papers/PDK91.html (104 words)

	Abstract State Machines: Compiler Correctness (Site not responding. Last check: 2007-09-06)
		Wolf Zimmerman, and Thilo Gaul, "On the Construction of Correct Compiler Back-Ends: An ASM Approach", Journal of Universal Computer Science, vol.
		A formal semantics for Occam, along with a hierarchy of provably correct refinements to the Transputer Instruction Set architecture.
		The author uses ASMs to prove the correctness of this well-known technique in a non-trivial subset of Pascal.
	www.uni-paderborn.de /cs/asm/Available_Materials/compiler.html (492 words)

	AI Technical Report Abstracts
		The other data-dependency based methods previously developed can not be easily incorporated in the Warren's abstract machine, and are not able to perform across-the-clause backtracking intelligently.
		For many problems this scheme is just as effective as intelligent backtracking schemes based upon (more accurate) analysis of unification failure, and yet incurs small space and time overhead.
		To demonstrate the usefulness of our scheme, we have modified a Warren's abstract machine simulator to incorporate our intelligent backtracking scheme, and have evaluated its performance on a number of problems.
	www.cs.utexas.edu /ftp/pub/AI-Lab/index/html/Abstracts.1986.html (2661 words)

	LtU Classic Archives
		The WAM, which enabled a generation of people to implement Prolog easily, and which stopped progress in Prolog implementation technology for a generation (literary license: a generation = a decade).
		To see how to go beyond the WAM in Prolog implementation, check out Andrew Taylor's thesis and Peter Van Roy's thesis, which appeared at nearly the same time.
		I am fascinated with the idea of constraint logic programming and logic languages in general, but have never found them to be well-suited for real use due to performance and limitations in the kinds of work that can be done.
	lambda-the-ultimate.org /classic/message1618.html (631 words)

	DBLP: David Scott Warren (Site not responding. Last check: 2007-09-06)
		Konstantinos F. Sagonas, Terrance Swift, David Scott Warren: An abstract machine for efficiently computing queries to well-founded models.
		Laxmikant V. Kalé, David Scott Warren: A Class of Architectures for a Prolog Machine.
		David Scott Warren, Joyce Friedman: Using Semantics in Non-Context-Free Parsing of Montague Grammar.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/w/Warren:David_Scott.html (1357 words)

	433-471 Logic Programming (Site not responding. Last check: 2007-09-06)
		Hassan Ait-Kaci: Warren's abstract machine: a tutorial reconstruction, MIT Press.
		The book is copyright by its author; please read the statement that lays down the conditions under which you may download the postscript file.
		Prolog and Mercury are installed on several machines in the department.
	www.cs.mu.oz.au /471 (648 words)

	Software and Systems Engineering - Publications
		abstract = {Relying on a derivation of the Warren Abstract Machine (WAM) by stepwise refinement of Prolog models by B\"orger and Rosenzweig we present a formalization of an operational semantics for Prolog.
		Then we develop four refinement steps towards the Warren Abstract Machine (WAM).
		The correctness and completeness proofs for each step have been elaborated with the theorem prover Isabelle using the logic HOL.
	www4.informatik.tu-muenchen.de /publ/bibtex.php?e=87 (101 words)

Try your search on: Qwika (all wikis)