1636 search results - page 159 / 328 » Type-Theoretic Functional Semantics |
148
click to vote
INFORMATICALT
2007
15 years 3 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
164
click to vote
ITA
2007
15 years 3 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
145
click to vote
ECIR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Traditional retrieval models assume that query terms are independent and rank documents primarily based on various term weighting strategies including TF-IDF and document...
135
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
130
click to vote
CAV
2009
Springer
16 years 4 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...