Sciweavers

JFP
2000
163views more  JFP 2000»
13 years 11 months ago
Automatic useless-code elimination for HOT functional programs
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...
Ferruccio Damiani, Paola Giannini
CORR
2004
Springer
98views Education» more  CORR 2004»
13 years 11 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui
JFP
2007
136views more  JFP 2007»
13 years 11 months ago
Practical type inference for arbitrary-rank types
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...
TCS
2008
13 years 11 months ago
Abstract interpretation and types for systems biology
Interpretation and Types for Systems Biology Fran
François Fages, Sylvain Soliman
TCS
2008
13 years 11 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol
DLS
2008
149views Languages» more  DLS 2008»
14 years 1 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
TAPSOFT
1991
Springer
14 years 3 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach
CONCUR
2006
Springer
14 years 3 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
CMSB
2006
Springer
14 years 3 months ago
Type Inference in Systems Biology
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
François Fages, Sylvain Soliman
ESOP
2009
Springer
14 years 3 months ago
Type-Based Automated Verification of Authenticity in Cryptographic Protocols
Gordon and Jeffrey have proposed a type and effect system for checking authenticity in cryptographic protocols. The type system reduces the protocol verification problem to the typ...
Daisuke Kikuchi, Naoki Kobayashi