Sciweavers

551 search results - page 8 / 111
» Natural proofs
Sort
View
TYPES
2007
Springer
14 years 5 months ago
A Declarative Language for the Coq Proof Assistant
This paper presents a new proof language for the Coq proof assistant. This language uses the declarative style. It aims at providing a simple, natural and robust alternative to the...
Pierre Corbineau
CJ
2006
78views more  CJ 2006»
13 years 11 months ago
A Very Mathematical Dilemma
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
Alan Bundy
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 9 months ago
Generating Bijections between HOAS and the Natural Numbers
ly correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a "not equals" relationship between terms and also to have ...
John Tang Boyland
IPL
2006
100views more  IPL 2006»
13 years 11 months ago
Strong normalization proofs by CPS-translations
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system
Satoshi Ikeda, Koji Nakazawa
EXTREME
2004
ACM
14 years 4 months ago
A Simple Proof for the Turing-Completeness of XSLT and XQuery
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
Stephan Kepser