
	Where results make sense

Topic: Graph reduction machine

Related Topics

graph theory

Glossary of graph theory

graph of a function

graph mathematics

tree graph theory

Graph coloring

planar graphs

directed graphs

complete graph

graphing calculator

directed acyclic graph

Perfect graph

In the News (Wed 15 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	[No title]
		The PABC machine is an abstract machine that is used to implement Concurrent Clean, an experimental lazy functional language.
		The parallel ABC machine is an abstract parallel machine used for creating and describing implementations of Concurrent Clean, a parallel functional language based on the principles of term graph rewriting.
		Processes are specified in GRAPH at two separate specification levels: At the functional level the input/output behavior of processes is specified by means of pgorgrams of a functional language.
	wotug.ukc.ac.uk /parallel/bibliographies/par-functional/fpcnew.bib (4150 words)

	Hemodialysis Machine
		With all contemporary machines, the dialysate concentrate is fed into the machine, water is fed from a water tank and a marvelous pump mixes them to the desired concentration.
		However, in many centers all machines are set to the same temperature, and in many cases it is too cold, in addition to the freezing air-condition.
		To remove air from the blood lines and dialyzer, the machine should run for a few minutes with the dialyzer mounted upside down, that is, the red header is down and the blue one is up.
	gil1.home.pipeline.com /esrd/dmachine.htm (6461 words)

	Graph manager for a reduction processor evaluating programs stored as binary directed graphs employing variable-free ...
		The substitutions performed to reduce a graph require the manipulation of a number of different pieces of data, such as pointers and combinator codes, which are shifted from one location to another in a register file.
		The principal element is graph manager 10, which contains a data section which caches some of the nodes of a graph that is to be reduced and allows for those nodes to be manipulated to perform the series of substitutions required for the graph reduction.
		In prior art reduction processors, this series of transfers was performed sequentially, and a similar series of transfers was performed to reduce the graph of FIG.
	www.freepatentsonline.com /4644464.html (3609 words)

	Reduction - Computing Reference - eLook.org
		The most important forms are beta reduction (application of a lambda abstraction to one or more argument expressions) and delta reduction (application of a mathematical function to the required number of arguments).
		An evaluation strategy (or reduction strategy), determines which part of an expression (which redex) to reduce first.
		See graph reduction, string reduction, normal order reduction, applicative order reduction, parallel reduction, alpha conversion, beta conversion, delta conversion, eta conversion.
	www.elook.org /computing/reduction.htm (83 words)

	[No title]
		Compiled graph reduction and data flow are joined in the D-machine, resulting in lazy data flow.
		Data flow machines are parallel stack machines, which in their pure data flow form have zero or one item in the stack.
		The D-machine is both a data flow machine, a stack machine, and a machine for compiled graph reduction.
	www.cs.chalmers.se /~kent/Wintermeetings/1988/DM.mm (10009 words)

	Re: Note on graph vs. term reduction
		For graph reduction of the lambda calculus, the original reference is %A Wadsworth, C. %T Semantics and pragmatics of the lambda calculus %R D.Phil.
		For graph rewriting implementation of functional languages, see: %A Peyton-Jones, S.L. %T The Implementation of Functional Languages %I Prentice-Hall %D 1987 For the optimality properties of combinator graph reduction, there is a series of three papers by Staples (which actually prove it for regular term graph rewrite systems, of which combinatory logic is an example).
		These conferences are concerned with graph rewriting in general, not just the particular application to functional language implementation.
	www.seas.upenn.edu /~sweirich/types/archive/1990/msg00006.html (760 words)

	Glasgow FP Seminars 1992-93 (Site not responding. Last check: 2007-10-23)
		In this talk, I will present parallel graph reduction of the lazy lambda-calculus with rec and strictness annotations as a Chemical Abstract Machine, and show that the resulting testing semantics is adequate wrt testing equivalence for the lazy lambda-calculus.
		Supercombinator graph reduction is a popular implementation technique for non-strict functional programming languages, and the approach is well-suited to parallel processing.
		The impact of speculative evaluation on conservative reduction is assessed by comparing the execution times for the same benchmark executed with both conservative and speculative evaluation strategies.
	www.dcs.gla.ac.uk /fp/seminars/FPseminars92-93.html (1553 words)

	Compiling Lazy Functional Languages: An introduction (ResearchIndex) (Site not responding. Last check: 2007-10-23)
		In graph reduction, the expression being reduced is represented A by a directed graph (in Wadsworth's reducer it is also acyclic).
		When a reduction rule is applied, be it fi-reduction as in this case, or e.g.
		20 Alice: a multi-processor reduction machine for the parallel..
	citeseer.csail.mit.edu /3555.html (566 words)

	* Compile - (Computing): Definition (Site not responding. Last check: 2007-10-23)
		A computer program which reads a computer program in a higher level (see ordinality) language, usually in the one a human programmer uses to state his problem algorithmically,...
		Object code is executable machine code or a variation of machine code...
		A compiler's back-end generates machine language and performs optimizations specific to the machine's architecture...
	www.bestknows.com /computing/compile.html (1144 words)

	Selected Papers
		A complete specification of the reduction and the narrowing machine and of the translation of a sample language into abstract machine code is given.
		Comparative results of a C-implementation of the reduction and the narrowing machine show that the time overhead of the more complex narrowing evaluation is, in general, less than 10% of the reduction evaluation.
		Considering programmed graph reduction as a generalization of conventional environment-based implementations where the activation records are allocated in a graph instead of on a stack it becomes very easy to use this technique for the execution of functional programs in a parallel machine with distributed memory.
	www.mathematik.uni-marburg.de /~loogen/research.html (2313 words)

	[No title] (Site not responding. Last check: 2007-10-23)
		Graph machines are defined to be the semantic evaluators in which either the program manipulates graphs as data objects in order to obtain the manifest value, or the program itself is represented as a graph, which after successive reductions will arrive at the least fix point being the manifest value.
		One of the current projects is the development of a graph reduction machine, called G-machine, which uses normal order semantics to evaluate LML programs -- LML is a lazy equational language.
		Moreover, a parallel and then a distributed multi-collector system have been developed, both based on a modified reference counting technique with the only communication being simple message passing, and both relying on minimum synchronization among collectors.
	www.cs.mun.ca /~ashoke/grad-proj-graph.html (195 words)

	[No title] (Site not responding. Last check: 2007-10-23)
		Kuchen, J.J. Moreno Navarro, M.V. Hermenegildo We present a parallel graph narrowing machine, which is used to implement a functional logic language on a shared memory multiprocessor.
		It is an extension of an abstract machine for a purely functional language.
		The result is a programmed graph reduction machine which integrates the mechanisms of unification, backtracking, and independent and-parallelism.
	sunsite.informatik.rwth-aachen.de /Publications/AIB/1992/1992-22.abstract (103 words)

	DoSE 1997 Publications
		The development is carried out within the discipline of the B Method and using the B Toolkit, and the paper is a tutorial on the use of the B Method's abstract machine notation for the specification and design of abtract datatypes.
		The method uses state machines, defined using logic and set theory with a notation similar to that of Z, that export operations.
		The method supports a notion of refinement and implementation, which is based on the notion of refinement in the refinement calculus with the exception that there is no distinction between procedural and data refinement.
	www.cse.unsw.edu.au /research/publications/1997/DoSE_publications.html (1803 words)

	[No title]
		Secondly any loops identified during the construction of the graph will mean that the condition can never be satisfied, and are used in the application of the temporal resolution rule thus deriving further formulae.
		The standard approach to such problems is first to reduce the original geometrical specification to a finite graph of possible routes, and then to use graph-searching techniques together with the metrical information available in the original geometrical specification to select the best of these routes.
		Although hardware designers expect their designs to represent finite state machines, explicit semantics is needed to calculate these state machines in general.
	www.csse.monash.edu.au /mirrors/bibliography/Techreports/university-of-manchester.unique (9142 words)

	NSF-ALADDIN Workshop on Graph Partitioning in Vision and Machine Learning
		Graph cuts and separators of various forms have a long history in Algorithms.
		In Machine Learning, there has been increasing interest in problems of learning from labeled and unlabeled data, as well as probabilistic inference when data have pairwise relationships, that seem closely related to notions of graph partitioning.
		The purpose of this workshop is to bring together researchers in Algorithms, Vision, and Machine Learning around the subject of graph partitioning and other graph algorithms, in order to discuss and better understand the connections between these problems and the techniques used to solve them.
	www-2.cs.cmu.edu /afs/cs/project/aladdin/www/workshops/graph (315 words)

	DOC Research Report 1992-94: ALA General Interests (Site not responding. Last check: 2007-10-23)
		The Advanced Languages and Architectures Section's research is concerned with a set of related technologies that aim to apply well founded techniques to the development of practical solutions in a wide variety of application domains.
		We are proud that pioneering work in the mid 80's in the design and construction of the ALICE parallel graph reduction machine led to a highly successful series of collaborations with ICL that resulted in the Goldrush parallel machine that was introduced by ICL as a commercial product in 1993.
		We are concerned with the development of high level methods for programming parallel machines that provide portability across various architectures while ensuring efficient performance on particular machines.
	www.doc.ic.ac.uk /old-doc/report/ala_s10.html (720 words)

	Research Activities
		In particular, other than top-level reduction steps may be carried out in any selected part of a program without causing side-effects in other parts (referential transparency).
		on the implementation level, the compilation of abstract machine code (which so far has been interpreted) to C in order to be competitive, in terms of run-time efficiency, with more conventional implementations of functional languages.
		As a side line of this work, we are also looking into ways and means of designing a reversible reduction machine so that a program that has been reduced to normal form can be executed backward, by application of complementary reduction rules, to re-produce the original program.
	www.informatik.uni-kiel.de /inf/Kluge/research.html (613 words)

	Graph Reduction 1986
		Benjamin Goldberg, Paul Hudak: Alfalfa: Distributed graph reduction on a hypercube multiprocessor.
		Randy Michelson, Lauren Smith, Elizabeth Williams, Bonnie Yantis: Parallel Graph Reduction on a Supercomputer: A Status Report.
		Ian Watson, Paul Watson: Graph reduction in a parallel virtual memory environment.
	www.informatik.uni-trier.de /~ley/db/conf/gr/gr1986.html (321 words)

	Languages for the Java VM
		Alternative Java Implementations which provides a list of implementations of Java Virtual Machines (JVMs), Java library implementations, Java compilers to byte code, and compilers of bytecode or Java source to machine code.
		The SECD virtual machine is used to execute both the compiler and the compiled programs.
		JGNAT comprises a compiler generating Java bytecode that is compatible with Java virtual machines conforming to Sun's standard (JDK 1.1 and above), and a set of tools to aid in developing Ada programs for the Java platform.
	flp.cs.tu-berlin.de /~tolk/vmlanguages.html (10412 words)

	An Architecture for Combinator Graph Reduction (TIGRE)
		The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented.
		The abstract machine, called TIGRE, exhibits reduction rates that, for similar kinds of combinator graphs on similar kinds of hardware, compare favorably with previously reported techniques.
		From the results of the simulation study, a conclusion is made that combinator-graph reduction using TIGRE runs most efficiently when using a cache memory with an allocate-on-write-miss strategy, moderately large block size (preferably with sub-block placement), and copy-back memory updates.
	www.ece.cmu.edu /~koopman/tigre/index.html (440 words)

	UMCS-91-11-1 System software on the Flagship parallel graph reduction machine (Site not responding. Last check: 2007-10-23)
		The Flagship system was a graph reduction machine having a distributed physical architecture.
		Although Flagship was firmly in the declarative world, explicit state was supported in the graph reduction model to express the behaviour of the operating system.
		This state not only had to be isolated from the declarative aspects of the Flagship machine, but also had to be supported with respect to distribution.
	www.cs.man.ac.uk /cstechrep/Abstracts/UMCS-91-11-1.html (156 words)

	Warwick: DCS: Reports and Theses (Site not responding. Last check: 2007-10-23)
		A parallel graph reduction machine simulator is described.
		This performs combinator reduction and can simulate various different parallel reduction strategies.
		A number of functional programs are examined, and experimental results presented comparing the amount of parallelism obtainable using explicit divide-and-conquer with the maximum amount of parallelism available in the programs.
	www.dcs.warwick.ac.uk /reports/210.html (72 words)

	2350 langages de programmation (1945-1995)
		Intermediate language for the ABC abstract machine for implementation of functional languages, similar to the spineless tagless G-machine.
		Autocoding came to be a generic term for symbolic assembly language programming, and versions of Autocode were developed for many machines: Ferranti Atlas, Titan, Mercury and Pegasus, and IBM 702 and 705.
		A machine- description language based on modeling the computer as a finite state machine.
	www.seg.etsmtl.ca /sylvie/APSI/Ressources/lang-list_liste.htm (11995 words)

	The BOHM machine (Site not responding. Last check: 2007-10-23)
		The light version provides a much sharper syntactical control over the shape of sharing graphs than that provided by the rough encoding of intuitionistic implication into linear logic, with a significant impact on the efficiency of the reduction.
		BOHM is a simple interpreter written in C, and it runs on most systems having a C compiler, including Personal Computers.
		Two typical cases are the incremental modification of arrays represented as functions from indices to values, and the direct evaluation of Denotational Semantics for imperative languages.
	cristal.inria.fr /~levy/confer/ppr1/node80.html (254 words)

	Parallel Functional Programming - SkaLinks.com (Site not responding. Last check: 2007-10-23)
		It is based on massive parallel graph-reduction machine.
		It is built as a hybrid architecture using a simple Lisp interpreter for driving the compiler and wrapping calls to the Graph-reduction VM.
		Lambda terms are compiled to variablefree Combinator Graphs.
	www.skalinks.com /dir/detailed/listing306.html (110 words)

	Dictionary of Algorithms and Data Structures
		deterministic finite automaton: see deterministic finite state machine
		The Stony Brook Algorithm Repository, which has algorithms organized by type, succinct, illustrated definitions, and ratings of sites with implementations.
		Data Structures and Algorithms is a wonderful site with illustrations, explanations, analysis, and code taking the student from arrays and lists through trees, graphs, and intractable problems.
	www.nist.gov /dads (686 words)

	compile from FOLDOC (Site not responding. Last check: 2007-10-23)
		Some compilers output assembly language which is then converted to machine language by a separate assembler.
		A compiler is distinguished from an assembler by the fact that each input statement does not, in general, correspond to a single machine instruction or fixed sequence of instructions.
		A compiler may support such features as automatic allocation of variables, arbitrary arithmetic expressions, control structures such as FOR and WHILE loops, variable scope, input/ouput operations, higher-order functions and portability of source code.
	www.instantweb.com /foldoc/foldoc.cgi?query=compile (336 words)

	Ion Exchange Systems and Equipment
		We can monitor, graph, control and/or make program changes to your system in a matter of minutes.
		Our Power Purge regeneration system is the most efficient (See graph) in the industry providing the highest concentration of metal in the smallest volume of regenerant.
		In conjunction with a water reduction program and multiple rinse stations, the cost savings and benefits are dramatic.
	www.remco.com (1840 words)

	Graph Connectivity References
		A new partition lemma for planar graphs and its application to circuit complexity.
		Optimal parallel algorithms for integer sorting and graph connectivity.
		Optimized redundant cell collection in a parallel graph reduction machine using reference counts.
	www.cs.cmu.edu /~scandal/alg/cc-refs.html (459 words)

Try your search on: Qwika (all wikis)