Sciweavers

1805 search results - page 35 / 361
» A Theory of Closure Operators
Sort
View
ENTCS
2008
79views more  ENTCS 2008»
15 years 4 months ago
Tensors of Comodels and Models for Operational Semantics
In seeking a unified study of computational effects, in particular in order to give a general operational semantics agreeing with the standard one for state, one must take account...
Gordon D. Plotkin, John Power
IFL
2001
Springer
15 years 8 months ago
Proving the Correctness of the STG Machine
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...
Alberto de la Encina, Ricardo Pena
WIA
1999
Springer
15 years 8 months ago
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
Gertjan van Noord, Dale Gerdemann
ENTCS
2006
125views more  ENTCS 2006»
15 years 4 months ago
Formalizing Type Operations Using the "Image" Type Constructor
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...
Aleksey Nogin, Alexei Kopylov
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno