AbstractIn the first part of this talk, I will review the thought that led to the G-machine. In the second part, I will describe some recent work on formalising the 'avoiding graph reduction' bit, by doing fold/unfold transformation on a basic inefficient graph constructing interpreter
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
AbstractIn “Syntactic Control of Interference” (POPL, 1978), J. C. Reynolds proposes three design pr...
AbstractInfinitary rewriting allows infinitely large terms and infinitely long reduction sequences. ...
Johnsson's G-Machine is a major achievement in the efficient implementation of lazy functional langu...
AbstractThere are two quite different possibilities for implementing linear head reduction in λ-calc...
AbstractIn this tutorial, some basic ideas will be outlined and exemplified how graph transformation...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractMuch recent work on the compilation of statically typed languages such as ML relies on the p...
AbstractThis is a preliminary report, in which we prove the so-called standardization lemma for the ...
Prosodic boundary detection is important to disambiguate parsing, especially in spontaneous speech, ...
In this paper we build upon results of Padua and Wolfe~\cite{PaduaWo86}, who introduce two graph tra...
AbstractNotational definitions are pervasive in mathematical practic and are therefore supported in ...
We describe a number of experiments that demonstrate the usefulness of prosodic information for a pr...
To integrate CA*-systems with other applications in the world of CIM, one principal approach current...
AbstractLast works in linear logic mark a trend that can be summarized as: studying of fragments of ...
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
AbstractIn “Syntactic Control of Interference” (POPL, 1978), J. C. Reynolds proposes three design pr...
AbstractInfinitary rewriting allows infinitely large terms and infinitely long reduction sequences. ...
Johnsson's G-Machine is a major achievement in the efficient implementation of lazy functional langu...
AbstractThere are two quite different possibilities for implementing linear head reduction in λ-calc...
AbstractIn this tutorial, some basic ideas will be outlined and exemplified how graph transformation...
AbstractWe present an algorithm for checking whether an infinite transition system, defined by a gra...
AbstractMuch recent work on the compilation of statically typed languages such as ML relies on the p...
AbstractThis is a preliminary report, in which we prove the so-called standardization lemma for the ...
Prosodic boundary detection is important to disambiguate parsing, especially in spontaneous speech, ...
In this paper we build upon results of Padua and Wolfe~\cite{PaduaWo86}, who introduce two graph tra...
AbstractNotational definitions are pervasive in mathematical practic and are therefore supported in ...
We describe a number of experiments that demonstrate the usefulness of prosodic information for a pr...
To integrate CA*-systems with other applications in the world of CIM, one principal approach current...
AbstractLast works in linear logic mark a trend that can be summarized as: studying of fragments of ...
AbstractAlgebraic graph transformations visually support intuition, have a strong theoretical basis,...
AbstractIn “Syntactic Control of Interference” (POPL, 1978), J. C. Reynolds proposes three design pr...
AbstractInfinitary rewriting allows infinitely large terms and infinitely long reduction sequences. ...
DOI
Add to ORKG