Sciweavers

7681 search results - page 24 / 1537
» Typed Membrane Systems
Sort
View
CISIS
2007
IEEE
14 years 1 months ago
P Systems and Finite Automata
Abstract— In this paper, we integrate the traditional finitestate automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrat...
Xian Xu
SYNASC
2005
IEEE
77views Algorithms» more  SYNASC 2005»
14 years 1 months ago
On P Systems with Bounded Parallelism
— A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural op...
Francesco Bernardini, Francisco José Romero...
ECOOP
2012
Springer
11 years 9 months ago
Inference and Checking of Object Ownership
Ownership type systems describe a heap topology and enforce an encapsulation discipline; they aid in various program correctness and understanding tasks. However, the annotation ov...
Wei Huang, Werner Dietl, Ana Milanova, Michael D. ...
ICFP
2004
ACM
14 years 7 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
LICS
2000
IEEE
13 years 11 months ago
A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping
We introduce a new model based on coherence spaces for interpreting large impredicative type systems such as the Extended Calculus of Constructions (ECC). Moreover, we show that t...
Alexandre Miquel