1143 search results - page 116 / 229 » Mental models of recursion |
VMCAI
2009
Springer
14 years 3 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
JMLR
2011
13 years 4 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
ICFP
2004
ACM
14 years 9 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
JFP
2006
13 years 9 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...