2705 search results - page 361 / 541 » Formal Ontology for Subject |
212
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
218
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
187
Voted
POPL
2005
ACM
16 years 1 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
211
Voted
POPL
2005
ACM
16 years 1 months ago
2005
ACM
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
162
Voted
POPL
2005
ACM
16 years 1 months ago
2005
ACM
In 1996, Gil and Lorenz proposed programming language constructs for specifying environmental acquisition in addition to inheritance acquisition for objects. They noticed that in ...