Sciweavers

182 search results - page 2 / 37
» A Theory of Strict P-completeness
Sort
View
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
13 years 11 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
SIGMETRICS
2006
ACM
128views Hardware» more  SIGMETRICS 2006»
14 years 6 days ago
GPS scheduling: selection of optimal weights and comparison with strict priorities
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
Pascal Lieshout, Michel Mandjes, Sem C. Borst
ECAL
2001
Springer
13 years 10 months ago
Formal Description of Autopoiesis Based on the Theory of Category
Since the concept of autopoiesis was proposed as a model of minimal living systems by Maturana and Varela, and applied to social systems by Luhmann, there has been only a few math...
Tatsuya Nomura
PEPM
2010
ACM
14 years 3 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
SUM
2007
Springer
14 years 11 days ago
Valued Hesitation in Intervals Comparison
Abstract. The paper presents a valued extension of the recently introduced concept of PQI interval order. The main idea is that, while comparing objects represented by interval of ...
Meltem Öztürk, Alexis Tsoukiàs