Sciweavers

169 search results - page 18 / 34
» A type system for well-founded recursion
Sort
View
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
13 years 12 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz
EUSFLAT
2009
137views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Novel Methods for the Design of General Type-2 Fuzzy Sets based on Device Characteristics and Linguistic Labels Surveys
Fuzzy Logic Systems are widely recognized to be successful at modelling uncertainty in a large variety of applications. While recently interval type-2 fuzzy logic has been credited...
Christian Wagner, Hani Hagras
POPL
2008
ACM
14 years 8 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
POPL
2010
ACM
14 years 5 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi