26 search results - page 3 / 6 » Proving the Equivalence of Higher-Order Terms by Means of Su... |
101
click to vote
JFP
2000
14 years 11 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
97
Voted
TCS
2008
14 years 11 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
189
click to vote
POPL
2007
ACM
15 years 12 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
AOSD
2007
ACM
15 years 3 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
103
click to vote
TLDI
2009
ACM
15 years 8 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...