Sciweavers

300 search results - page 12 / 60
» Subset Types and Partial Functions
Sort
View
POPL
1997
ACM
13 years 11 months ago
Type-Checking Higher-Order Polymorphic Multi-Methods
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
François Bourdoncle, Stephan Merz
CADE
2006
Springer
14 years 7 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
DLS
2007
150views Languages» more  DLS 2007»
13 years 11 months ago
RPython: a step towards reconciling dynamically and statically typed OO languages
Although the C-based interpreter of Python is reasonably fast, implementations on the CLI or the JVM platforms offers some advantages in terms of robustness and interoperability. ...
Davide Ancona, Massimo Ancona, Antonio Cuni, Nicho...
FOCS
2009
IEEE
14 years 2 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
ICFP
1999
ACM
13 years 11 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil