Sciweavers

632 search results - page 57 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ASPLOS
2006
ACM
14 years 1 months ago
Atomicity and visibility in tiny embedded systems
Visibility is a property of a programming language’s memory model that determines when values stored by one concurrent computation become visible to other computations. Our work...
John Regehr, Nathan Cooprider, David Gay
POPL
2012
ACM
12 years 3 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
14 years 14 days ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
LADS
2007
Springer
14 years 1 months ago
Goal Selection Strategies for Rational Agents
In agent theory and agent programming, goals constitute the motivational attitude of rational agents and form the key concept in explaining and generating their pro-active behavior...
Nick A. M. Tinnemeier, Mehdi Dastani, John-Jules C...