838 search results - page 68 / 168 » From Natural Language to Formal Proof Goal |
177
click to vote
ICALP
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
197
click to vote
ICDT
2011
ACM
14 years 9 months ago
2011
ACM
The goal of the PADS project, which started in 2001, is to make it easier for data analysts to extract useful information from ad hoc data files. This paper does not report new r...
164
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
211
click to vote
CL
2012
Springer
13 years 8 months ago
2012
Springer
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
166
click to vote
CSFW
1997
IEEE
15 years 10 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...