770 search results - page 6 / 154 » Dinatural Terms in System F |
109
click to vote
RTA
2011
Springer
14 years 14 days ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multicache systems are not well understood, especially in networks w...
99
Voted
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
89
Voted
ACL
2009
14 years 7 months ago
2009
This paper presents a novel metric-based framework for the task of automatic taxonomy induction. The framework incrementally clusters terms based on ontology metric, a score indic...