Sciweavers

1205 search results - page 43 / 241
» Program Extraction from Large Proof Developments
Sort
View
ICFP
2008
ACM
14 years 11 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
CIE
2006
Springer
14 years 2 months ago
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
Paulo Oliva
AGP
2010
IEEE
13 years 9 months ago
Concurrent and Reactive Constraint Programming
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...
LREC
2008
57views Education» more  LREC 2008»
14 years 12 days ago
A Development Environment for Configurable Meta-Annotators in a Pipelined NLP Architecture
Information extraction from large data repositories is critical to Information Management solutions. In addition to prerequisite corpus analysis, to determine domain-specific char...
Youssef Drissi, Branimir Boguraev, David Ferrucci,...
COLING
2000
14 years 10 days ago
Automatic Acquisition of Domain Knowledge for Information Extraction
In developing an Infbrmation Extraction tIE) system tbr a new class of events or relations, one of the major tasks is identifying the many ways in which these events or relations ...
Roman Yangarber, Ralph Grishman, Pasi Tapanainen, ...