Sciweavers

5415 search results - page 721 / 1083
» The Implementation of Functional Programming Languages
Sort
View
FOSSACS
2004
Springer
16 years 5 days ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
CDES
2008
90views Hardware» more  CDES 2008»
15 years 8 months ago
Nanocompilation for the Cell Matrix Architecture
- The Cell Matrix Architecture is a massive array of dynamically self-configurable, uniformly connected, identical computational units. This architecture can enable efficient, prac...
Thomas Way, Rushikesh Katikar, Ch. Purushotham
PROCEDIA
2010
281views more  PROCEDIA 2010»
15 years 5 months ago
Introductory computational science using MATLAB and image processing
We describe a new course designed to introduce engineering students to computational thinking. One of the most significant challenges in teaching an introductory-level applied co...
D. Brian Larkins, William Harvey
TCS
2011
15 years 1 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ATAL
2010
Springer
15 years 8 months ago
Formalizing organizational constraints: a semantic approach
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...