Sciweavers

7555 search results - page 22 / 1511
» The Type System of DBPL
Sort
View
ENTCS
2000
80views more  ENTCS 2000»
13 years 8 months ago
The simply typed rewriting calculus
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
Horatiu Cirstea, Claude Kirchner
IPL
2002
86views more  IPL 2002»
13 years 8 months ago
A polynomial algorithm for lot-size scheduling of two type tasks
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Mikhail Y. Kovalyov, Marcus Pattloch, Günter ...
ENTCS
2002
84views more  ENTCS 2002»
13 years 8 months ago
Set Types and Applications
We present pmlB, a programming language that includes primitive sets and associated operations. The language is equipped with a precise type discipline that statically captures dy...
Christian Skalka, Scott F. Smith
PADL
2012
Springer
12 years 4 months ago
Typing the Numeric Tower
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Fla...
ENTCS
2002
128views more  ENTCS 2002»
13 years 8 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori