797 search results - page 86 / 160 » Eliminating Proofs from Programs |
196
click to vote
POPL
2012
ACM
14 years 1 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...
163
Voted
ICFP
2006
ACM
16 years 6 months 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...
180
Voted
ICS
2010
Tsinghua U.
15 years 10 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...
170
click to vote
APLAS
2009
ACM
16 years 20 days 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...
149
Voted
ESOP
2005
Springer
15 years 11 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...