Sciweavers

12 search results - page 2 / 3
» Toward a foundational typed assembly language
Sort
View
POPL
2012
ACM
12 years 24 days ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
13 years 10 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
EMSOFT
2004
Springer
13 years 10 months ago
Towards a higher-order synchronous data-flow language
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfi...
Jean-Louis Colaço, Alain Girault, Gré...
POPL
2003
ACM
14 years 5 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
BIRTHDAY
2003
Springer
13 years 10 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg