Sciweavers

704 search results - page 9 / 141
» A Note on Typing Feature Structures
Sort
View
POPL
2006
ACM
14 years 7 months ago
Stratified type inference for generalized algebraic data types
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
François Pottier, Yann Régis-Gianas
JFP
2010
142views more  JFP 2010»
13 years 5 months ago
Linear type theory for asynchronous session types
Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system can be verified ...
Simon J. Gay, Vasco Thudichum Vasconcelos
ASPLOS
2006
ACM
14 years 20 days ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
TPHOL
2005
IEEE
14 years 8 days ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
13 years 10 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones