Sciweavers

3591 search results - page 13 / 719
» Typing linear constraints
Sort
View
SAS
2007
Springer
14 years 4 months ago
Refactoring Using Type Constraints
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
Frank Tip
CADE
2002
Springer
14 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
CONCUR
2010
Springer
13 years 11 months ago
A Linear Account of Session Types in the Pi Calculus
Abstract. We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are ...
Marco Giunti, Vasco T. Vasconcelos
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 5 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
IEEECGIV
2009
IEEE
14 years 5 months ago
Thai Font Type Recognition Using Linear Interpolation Analysis
A new approach to Thai font type recognition that is presented in this paper is based on linear interpolation analysis of the character contour. The algorithm can perform effectiv...
Pitchaya Jamjuntr, Natasha Dejdumrong