Sciweavers

105 search results - page 3 / 21
» Encoding Intensional Type Analysis
Sort
View
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
FPCA
1995
13 years 11 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
POPL
2012
ACM
12 years 3 months 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...
GPCE
2004
Springer
14 years 27 days ago
A Fresh Calculus for Name Management
Abstract. We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (...
Davide Ancona, Eugenio Moggi
LREC
2010
179views Education» more  LREC 2010»
13 years 9 months ago
Building a Bank of Semantically Encoded Narratives
We propose a methodology for a novel type of discourse annotation whose model is tuned to the analysis of a text as narrative. This is intended to be the basis of a "story ba...
David K. Elson, Kathleen McKeown