1321 search results - page 150 / 265 » Subtyping in Logical Form |
175
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
188
click to vote
ACL
2009
15 years 4 months ago
2009
We present a new approach to learning a semantic parser (a system that maps natural language sentences into logical form). Unlike previous methods, it exploits an existing syntact...
140
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
146
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
145
click to vote
ICSE
2009
IEEE-ACM
16 years 7 months ago
2009
IEEE-ACM
Software engineers often inspect program differences when reviewing others' code changes, when writing check-in comments, or when determining why a program behaves differentl...