The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 121 –
138 of
138
The paradigm of type-based termination is explored for functional
programming with recursive data types.
The article introduces , a lambda-calculus with
recursion, inductive types,
subtyping and bounded quantification. Decorated type
variables representing approximations of inductive types are used to
track the size of function arguments and return values.
The system is shown to be type safe and strongly normalizing.
The main novelty is a bidirectional type checking algorithm whose
...
In formal language theory, many families of languages are defined
using either grammars or finite acceptors. For instance,
context-sensitive languages are the languages generated by growing
grammars, or equivalently those accepted by Turing machines whose
work tape's size is proportional to that of their input. A few years
ago, a new characterisation of context-sensitive languages as the
sets of traces, or path labels, of rational graphs (infinite graphs
defined by sets of finite-state...
The recently introduced model of transducing by observing is compared with traditional models for computing transductions on the one hand and the recently introduced restarting transducers on the other hand. Most noteworthy, transducing observer systems with length-reducing rules are almost equivalent to RRWW-transducers. With painter rules we obtain a larger class of relations that additionally includes nearly all rational relations.
The class of translation grammars is introduced. This class is characterized by a possibility to implement a formal translation as an algorithm directed by parsing. To perform a translation, the conventional parser is extended by a facility to perform output operations within the parsing actions shift and reduce. The definitions of Kernel- and -translation grammars are presented. The transformations shaking-down and postponing that enable to transform some translation grammars into Kernel...
First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths restricted by control languages. It demonstrates that if the control languages are regular, these grammars generate the family of context-free languages. Then, in a similar way, the paper introduces tree-controlled grammars with derivation-tree cuts restricted by control languages. It proves that if the cuts are restricted by regular languages, these grammars generate the family of recursively enumerable...
This paper presents two extensions of the second order polymorphic
lambda calculus, system F, with monotone (co)inductive types supporting
(co)iteration, primitive (co)recursion and inversion principles as
primitives. One extension is inspired by the usual categorical
approach to programming by means of initial algebras and final
coalgebras; whereas the other models dialgebras, and can be seen as an extension of Hagino's
categorical lambda calculus within the framework of parametric
polymorphism....
The paper presents a system of Composite Graph Grammars (CGGs) modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values to element...
We exhibit a new class of grammars with the help of weightfunctions. They are characterized by decreasing the weight during the derivation process. A decision algorithm for the emptiness problem is developed. This class contains non-contextfree grammars. The corresponding language class is identical to the class of ultralinear languages.
We exhibit a new class of grammars with the help of weightfunctions. They are characterized by decreasing the weight during the derivation process. A decision algorithm for the emptiness problem is developed. This class contains non-contextfree grammars. The corresponding language class is identical to the class of ultralinear languages.
Currently displaying 121 –
138 of
138