Sciweavers

3583 search results - page 6 / 717
» A Type System for the Relational Calculus of Object Systems
Sort
View
TOCL
2012
235views Formal Methods» more  TOCL 2012»
11 years 10 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
POPL
1998
ACM
13 years 11 months ago
The SLam Calculus: Programming with Secrecy and Integrity
The SLam calculus is a typed -calculus that maintains security information as well as type information. The type system propagates security information for each object in four for...
Nevin Heintze, Jon G. Riecke
BIRTHDAY
2004
Springer
14 years 27 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
ROOM
2000
13 years 8 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark
CONCUR
2000
Springer
13 years 12 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii