Sciweavers

185 search results - page 18 / 37
» Induction in an Abstraction Space: A Form of Constructive In...
Sort
View
MCMASTER
1993
14 years 26 days ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
JAR
2010
108views more  JAR 2010»
13 years 7 months ago
Procedural Representation of CIC Proof Terms
Abstract. In this paper we propose an effective procedure for translating a proof term of the Calculus of Inductive Constructions (CIC), which is very similar to a program written...
Ferruccio Guidi
ILP
2007
Springer
14 years 2 months ago
Using ILP to Construct Features for Information Extraction from Semi-structured Text
Machine-generated documents containing semi-structured text are rapidly forming the bulk of data being stored in an organisation. Given a feature-based representation of such data,...
Ganesh Ramakrishnan, Sachindra Joshi, Sreeram Bala...
PLPV
2009
ACM
14 years 5 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
WDAG
2001
Springer
104views Algorithms» more  WDAG 2001»
14 years 1 months ago
A New Synchronous Lower Bound for Set Agreement
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle