Sciweavers

479 search results - page 37 / 96
» Sound and Complete Type Inference for a Systems Programming ...
Sort
View
127
Voted
ESOP
2007
Springer
15 years 6 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
FLOPS
2008
Springer
15 years 4 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
136
Voted
ICRA
2009
IEEE
147views Robotics» more  ICRA 2009»
15 years 9 months ago
Equipping robot control programs with first-order probabilistic reasoning capabilities
— An autonomous robot system that is to act in a real-world environment is faced with the problem of having to deal with a high degree of both complexity as well as uncertainty. ...
Dominik Jain, Lorenz Mösenlechner, Michael Be...
ENTCS
2006
125views more  ENTCS 2006»
15 years 2 months ago
Estimating the Cost of Native Method Calls for Resource-bounded Functional Programming Languages
We address the problem of applying resource-bounded functional programming languages in practice on object-oriented virtual machines which include calls to native methods coded in...
Stephen T. Gilmore, Olha Shkaravska
116
Voted
POPL
1999
ACM
15 years 7 months ago
Type-Safe Linking and Modular Assembly Language
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...
Neal Glew, J. Gregory Morrisett