Search Sciweavers | Sciweavers

12

TPHOL
2007
IEEE

122views Automated Reasoning» more TPHOL 2007»

Simple Types in Type Theory: Deep and Shallow Encodings

14 years 22 hour ago

Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...

François Garillot, Benjamin Werner

claim paper

Read More »

20

click to vote

JFP
2007

136views more JFP 2007»

Practical type inference for arbitrary-rank types

13 years 5 months ago

Download research.microsoft.com

Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...

Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...

claim paper

Read More »

17

click to vote

ESOP
2007
Springer

110views Programming Languages» more ESOP 2007»

Type Reconstruction for General Refinement Types

13 years 9 months ago

Download sage.soe.ucsc.edu

Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...

Kenneth W. Knowles, Cormac Flanagan

claim paper

Read More »

6

click to vote

DAGSTUHL
2007

75views Software Engineering» more DAGSTUHL 2007»

On the tail decay of M/G/1-type Markov renewal processes

13 years 7 months ago

Download www.dagstuhl.de

Dario Andrea Bini, Beatrice Meini, Vaidyanathan Ra...

claim paper