Sciweavers

154 search results - page 19 / 31
» Cobham recursive set functions
Sort
View
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
13 years 7 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 7 months ago
An approach to membrane computing under inexactitude
In this paper we introduce a fuzzy version of symport/antiport membrane systems. Our fuzzy membrane systems handle possibly inexact copies of reactives and their rules are endowed...
Jaume Casasnovas, Joe Miró, Manuel Moya, Fr...
EACL
1993
ACL Anthology
13 years 9 months ago
Type-Driven Semantic Interpretation of f-Structures
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...
Jürgen Wedekind, Ronald M. Kaplan
FPCA
1989
13 years 11 months ago
F-Bounded Polymorphism for Object-Oriented Programming
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
Peter S. Canning, William R. Cook, Walter L. Hill,...