6740 search results - page 406 / 1348 » Using Classification as a Programming Language |
126
click to vote
GI
2009
Springer
15 years 8 months ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
173
Voted
ICCL
1992
IEEE
15 years 7 months ago
1992
IEEE
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
194
click to vote
PEPM
2011
ACM
14 years 6 months ago
2011
ACM
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
145
Voted
FOSSACS
2008
Springer
15 years 5 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
116
Voted
SOSP
1993
ACM
15 years 5 months ago
1993
ACM
Many operating systems allow user programs to specify the protectionlevel (inaccessible, read-only, read-write) of pages in their virtual memory address space, and to handle any p...