400 search results - page 65 / 80 » Logical relations for monadic types |
WWW
2009
ACM
14 years 2 months ago
2009
ACM
Traditional relation extraction methods require pre-specified relations and relation-specific human-tagged examples. Bootstrapping systems significantly reduce the number of tr...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
ICSE
2005
IEEE-ACM
14 years 7 months ago
2005
IEEE-ACM
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...