163 search results - page 2 / 33 » Type Systems for Useless-Variable Elimination |
146
Voted
ENTCS
2002
15 years 3 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
126
Voted
WCRE
1999
IEEE
15 years 7 months ago
1999
IEEE
In reengineering an object-oriented system we want to benefit from the expertise developed in earlier efforts. It is therefore essential to have a way to communicate expertise at ...
135
Voted
CSFW
1997
IEEE
15 years 7 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
131
Voted
PADL
2004
Springer
15 years 8 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
144
click to vote
ENTCS
2002
15 years 3 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...