Sciweavers

7555 search results - page 76 / 1511
» The Type System of DBPL
Sort
View
DLS
2010
146views Languages» more  DLS 2010»
13 years 7 months ago
Experiences with an icon-like expression evaluation system
The design of the Icon programming language's expression evaluation system, which can perform limited backtracking, was unique amongst imperative programming languages when c...
Laurence Tratt
FUIN
2002
100views more  FUIN 2002»
13 years 8 months ago
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavo...
Brian Postow, Kenneth W. Regan, Carl H. Smith
ACTA
2005
101views more  ACTA 2005»
13 years 8 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König
FSTTCS
2007
Springer
14 years 3 months ago
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we...
Judicaël Courant, Cristian Ene, Yassine Lakhn...
IFIPTCS
2000
14 years 14 days ago
Ambient Groups and Mobility Types
Abstract. We add name groups and group creation to the typed ambient calculus. Group creation is surprisingly interesting: it has the e ect of statically preventing certain communi...
Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon