797 search results - page 86 / 160 » Eliminating Proofs from Programs |
129
Voted
POPL
2012
ACM
13 years 8 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
102
Voted
ICFP
2006
ACM
16 years 19 days ago
2006
ACM
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
119
click to vote
ICS
2010
Tsinghua U.
15 years 4 months ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
108
Voted
APLAS
2009
ACM
15 years 7 months ago
2009
ACM
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
98
Voted
ESOP
2005
Springer
15 years 6 months ago
2005
Springer
Abadi-Leino Logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need t...