Sciweavers

605 search results - page 22 / 121
» Dynamic inference of abstract types
Sort
View
NIPS
2007
13 years 10 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 5 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
14 years 3 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
VL
2002
IEEE
14 years 1 months ago
Visually Customizing Inference Rules About Apples and Oranges
We have been working on a unit system for end-user spreadsheets that is based on the concrete notion of units of the abstract concept of types. In previous work, we defined such ...
Margaret M. Burnett, Martin Erwig
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
14 years 2 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond