Sciweavers

1055 search results - page 75 / 211
» Enumerations in computable structure theory
Sort
View
135
Voted
GROUP
1999
ACM
15 years 8 months ago
From description to requirements: an activity theoretic perspective
This paper demonstrates how activity theoretic concepts can be used in conjunction with an ethnographically informed approach to derive requirements on a work situation. We presen...
Phil Turner, Susan Turner, Julie Horton
EACL
1989
ACL Anthology
15 years 5 months ago
Programming in Logic with Constraints for Natural Language Processing
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
Patrick Saint-Dizier
TGC
2010
Springer
15 years 2 months ago
An Algebra of Hierarchical Graphs
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
Roberto Bruni, Fabio Gadducci, Alberto Lluch-Lafue...
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
CCA
2009
Springer
15 years 8 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi