Sciweavers

41 search results - page 8 / 9
» On the Modularity of Deciding Call-by-Need
Sort
View
CP
1997
Springer
13 years 10 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
POPL
1990
ACM
13 years 10 months ago
Higher-Order Modules and the Phase Distinction
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
Robert Harper, John C. Mitchell, Eugenio Moggi
ISMVL
2010
IEEE
166views Hardware» more  ISMVL 2010»
13 years 9 months ago
Non-deterministic Multi-valued Logics--A Tutorial
Non-deterministic multi-valued matrices (Nmatrices) are a new, fruitful and quickly expanding field of research first introduced a few years ago. Since then it has been rapidly ...
Arnon Avron, Anna Zamansky
ICFP
2010
ACM
13 years 7 months ago
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
Stefan Holdermans, Jurriaan Hage
POS
1994
Springer
13 years 10 months ago
Expressing Object Residency Optimizations Using Pointer Type Annotations
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
J. Eliot B. Moss, Antony L. Hosking