Sciweavers

12452 search results - page 2189 / 2491
» An exploration of program as language
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 6 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
CORR
2000
Springer
133views Education» more  CORR 2000»
15 years 6 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
CORR
2000
Springer
112views Education» more  CORR 2000»
15 years 6 months ago
Evolution of differentiated expression patterns in digital organisms
Abstract. We investigate the evolutionary processes behind the development and optimization of multiple threads of execution in digital organisms using the avida platform, a softwa...
Charles Ofria, Christoph Adami, Travis C. Collier,...
CORR
2002
Springer
96views Education» more  CORR 2002»
15 years 6 months ago
Models and Tools for Collaborative Annotation
The Annotation Graph Toolkit (AGTK) is a collection of software which facilitates development of linguistic annotation tools. AGTK provides a database interface which allows appli...
Xiaoyi Ma, Haejoong Lee, Steven Bird, Kazuaki Maed...
ENTCS
2007
123views more  ENTCS 2007»
15 years 6 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
« Prev « First page 2189 / 2491 Last » Next »