Sciweavers

1147 search results - page 8 / 230
» Termination in language-based systems
Sort
View
RTA
1997
Springer
13 years 11 months ago
Proving Innermost Normalisation Automatically
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
Thomas Arts, Jürgen Giesl
FOSSACS
2005
Springer
14 years 1 months ago
Bridging Language-Based and Process Calculi Security
Language-based and process calculi-based information security are well developed fields of computer security. Although these fields have much in common, it is somewhat surprising...
Riccardo Focardi, Sabina Rossi, Andrei Sabelfeld
FROCOS
2009
Springer
14 years 2 days ago
A Declarative Agent Programming Language Based on Action Theories
We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between ...
Conrad Drescher, Stephan Schiffel, Michael Thielsc...
BIRTHDAY
2000
Springer
13 years 11 months ago
Pict: a programming language based on the Pi-Calculus
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports via simple encodings a wide range of high-level constru...
Benjamin C. Pierce, David N. Turner
ERCIMDL
2005
Springer
124views Education» more  ERCIMDL 2005»
14 years 1 months ago
A Hybrid Declarative/Procedural Metadata Mapping Language Based on Python
The Alexandria Digital Library (ADL) project has been working on automating the processes of building ADL collections and gathering the collection statistics on which ADL’s disco...
Greg Janee, James Frew