Sciweavers

7529 search results - page 425 / 1506
» The Modula-3 Type System
Sort
View
ATAL
2005
Springer
16 years 12 days ago
What kind of argument are we going to have today?
This paper is concerned with argumentation-based dialogues between agents. Much work in this area has been based upon an influential taxonomy of dialogue types developed by Walto...
Eva Cogan, Simon Parsons, Peter McBurney
TYPES
2004
Springer
16 years 6 days ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
GI
2009
Springer
15 years 11 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
DATE
1999
IEEE
80views Hardware» more  DATE 1999»
15 years 11 months ago
Time Constrained Modulo Scheduling with Global Resource Sharing
Commonly used scheduling algorithms in high-level synthesis only accept one process at a time and are not capable of sharing resources across process boundaries. This results in t...
Christoph Jäschke, Rainer Laur, Friedrich Bec...
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
15 years 11 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