3441 search results - page 466 / 689 » Parallel Logic Programming Systems |
266
Voted
POPL
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
141
click to vote
CADE
2004
Springer
16 years 5 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
127
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
165
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
147
click to vote
SEMCO
2007
IEEE
15 years 11 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...