Skip to search formSkip to main contentSkip to account menu

A foundation for actor computation

An actor language is presented which is an extension of a simple functional language, and an operational semantics for this extension is provided, and it is shown that the three forms of equivalence, namely, convex, must, and may equivalences, collapse to two in the presence of fairness.
View on Cambridge Press (opens in a new tab)

Subtyping Constrained Types

This paper develops several subtyping relations on polymorphic constrained types of a general form that allows recursive constraints and multiple bounds on type variables.
View via Publisher (opens in a new tab)

History Effects and Verification

This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The properties verified…
View via Publisher (opens in a new tab)

A systematic approach to static access control

This article develops type systems that can statically guarantee the success of access control checks, and shows that the security-passing style translation also gives rise to static security-aware type systems, by composition with conventional type systems.
View on ACM (opens in a new tab)

Towards a Theory of Actor Computation

It is shown that the usual tripartite family of testing equivalence relations collapses to two in the presence of fairness, and a notion of operational bisimulation is defined as a tool for establishing equivalence under fairness assumptions, and its use is illustrated.
View via Publisher (opens in a new tab)

Type inference for recursively constrained types and its application to OOP

View via Publisher (opens in a new tab)

Sound polymorphic type inference for objects

A polymorphic, constraint-based type inference algorithm for an object-oriented language, where the well-known tradeoff between inheritance and subtyping is mitigated by the type inference mechanism.
View on ACM (opens in a new tab)

Precise Constraint-Based Type Inference for Java

Data-Polymorphic CPA (DCPA), a novel constraint-based type inference algorithm which extends CPAwit h the ability to accurately and efficiently analyze data polymorphic programs, is implemented for the full Java language, and is used to statically verify the correctness of Java downcasts.
View via Publisher (opens in a new tab)

Types and trace effects of higher order programs

A type safety result is proven for both unification and subtyping constraint versions of the type system, ensuring that statically well-typed programs do not contain trace event checks that can fail at run-time.
View via Publisher (opens in a new tab)

Partial Objects In Constructive Type Theory

...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)