Sciweavers

921 search results - page 45 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
NJC
2000
169views more  NJC 2000»
13 years 7 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
ICFP
2007
ACM
14 years 7 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop
CSL
2007
Springer
14 years 2 months ago
The Theory of Calculi with Explicit Substitutions Revisited
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
Delia Kesner
CSL
2010
Springer
13 years 9 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
IJMMS
2006
74views more  IJMMS 2006»
13 years 7 months ago
Constructing computer-based tutors that are socially sensitive: Politeness in educational software
Students rated 16 tutorial statements on negative politeness (i.e., how much the tutor ``allows me freedom to make my own decisions'') and positive politeness (i.e., how...
Richard E. Mayer, W. Lewis Johnson, Erin Shaw, Sah...