Sciweavers

462 search results - page 21 / 93
» Function Types in Complete Type Inference
Sort
View
JOT
2007
102views more  JOT 2007»
13 years 7 months ago
Type Access Analysis: Towards Informed Interface Design
Programs designed from scratch often start with just a set of classes. Classes can be instantiated and so deliver the objects that are the carriers of information and function. In...
Friedrich Steimann, Philip Mayer
TLCA
2007
Springer
14 years 1 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
Estimating the Cost of Native Method Calls for Resource-bounded Functional Programming Languages
We address the problem of applying resource-bounded functional programming languages in practice on object-oriented virtual machines which include calls to native methods coded in...
Stephen T. Gilmore, Olha Shkaravska
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
14 years 27 days ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
TLCA
1993
Springer
13 years 11 months ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli