Sciweavers

3591 search results - page 46 / 719
» Typing linear constraints
Sort
View
JFP
2008
97views more  JFP 2008»
13 years 9 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
APLAS
2001
ACM
14 years 2 months ago
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
Abstract. We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as th...
Masahito Hasegawa
CADE
2010
Springer
13 years 12 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
OOPSLA
1991
Springer
14 years 2 months ago
Object-Oriented Type Inference
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
Jens Palsberg, Michael I. Schwartzbach
ICHIT
2009
Springer
14 years 5 months ago
A genetic algorithm approach for a constrained employee scheduling problem as applied to employees at mall type shops
In this application of artificial intelligence to a real-world problem, the constrained scheduling of employee resourcing for a mall type shop is solved by means of a genetic algo...
Adrian Brezulianu, Monica Fira, Lucian Fira