Add to ORKGWe explore foundational typing support for strong updates -- updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expressive type system based upon standard linear logic, one that also enjoys a simple semantic interpretation for types that is closely related to models for spatial logics. The typin
Mechanisation of programming language research is of growing interest, and the act of mechanising ty...
We start from an untyped, well-scoped lambda-calculus and introduce a bidirectional typing relation ...
The paper presents a simple format for typed logics with states by adding a function for register up...
Abstract. We present a simple, but expressive type system that supports strong updates—updating a me...
Abstract. This tutorial paper provides an introduction to intuitionistic logic and linear logic, and...
Past attempts to apply Girard's linear logic have either had a clear relation to the theory (La...
The linear logic of J.-Y. Girard suggests a new type system for functional languages, one which supp...
Linear types (types of values that can be used just once) have been drawing great attentions because...
Domain-specific languages are often embedded inside of general-purpose host languages so that the em...
Linear typing schemes can be used to guarantee non-interference and so the soundness of in-place upd...
Enhancing the type system of a programming language brings benefits on many fronts. We define and ex...
To appear in the journal Logical Methods in Computer Science.We describe a type system with mixed li...
Past attempts to apply Girard's linear logic have either had a clear relation to the theory (La...
International audienceWe study the type checking and type inference problems for intuitionistic line...
We present Fo, an extension of System F that uses kinds to distinguish between linear and unrestrict...
Mechanisation of programming language research is of growing interest, and the act of mechanising ty...
We start from an untyped, well-scoped lambda-calculus and introduce a bidirectional typing relation ...
The paper presents a simple format for typed logics with states by adding a function for register up...
Abstract. We present a simple, but expressive type system that supports strong updates—updating a me...
Abstract. This tutorial paper provides an introduction to intuitionistic logic and linear logic, and...
Past attempts to apply Girard's linear logic have either had a clear relation to the theory (La...
The linear logic of J.-Y. Girard suggests a new type system for functional languages, one which supp...
Linear types (types of values that can be used just once) have been drawing great attentions because...
Domain-specific languages are often embedded inside of general-purpose host languages so that the em...
Linear typing schemes can be used to guarantee non-interference and so the soundness of in-place upd...
Enhancing the type system of a programming language brings benefits on many fronts. We define and ex...
To appear in the journal Logical Methods in Computer Science.We describe a type system with mixed li...
Past attempts to apply Girard's linear logic have either had a clear relation to the theory (La...
International audienceWe study the type checking and type inference problems for intuitionistic line...
We present Fo, an extension of System F that uses kinds to distinguish between linear and unrestrict...
Mechanisation of programming language research is of growing interest, and the act of mechanising ty...
We start from an untyped, well-scoped lambda-calculus and introduce a bidirectional typing relation ...
The paper presents a simple format for typed logics with states by adding a function for register up...