2272 search results - page 443 / 455 » A Calculus for |
TACS
1994
Springer
14 years 20 days ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
TACS
1994
Springer
14 years 20 days ago
1994
Springer
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
CTCS
1989
Springer
14 years 20 days ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
FPCA
1989
14 years 20 days ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
AOSD
2009
ACM
14 years 18 days ago
2009
ACM
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...