Sciweavers

3573 search results - page 170 / 715
» Reasoning about Codata
Sort
View
166
Voted
HASKELL
2009
ACM
15 years 10 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
131
Voted
ICFP
2010
ACM
15 years 4 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen
CVPR
2005
IEEE
16 years 5 months ago
Hybrid Joint-Separable Multibody Tracking
Statistical models for tracking different moving bodies must be able to reason about occlusions in order to be effective. Representing the joint statistics across different bodies...
Oswald Lanz, Roberto Manduchi
107
Voted
CADE
2004
Springer
16 years 3 months ago
Formalizing Undefinedness Arising in Calculus
Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms a...
William M. Farmer
ICFP
2003
ACM
16 years 3 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper