275 search results - page 37 / 55 » Sequential Construction of Logical Forms |
197
click to vote
MCMASTER
1993
15 years 9 months ago
1993
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...
144
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
149
click to vote
LACL
2001
Springer
15 years 10 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
185
click to vote
CSFW
2012
IEEE
13 years 8 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
141
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...