Sciweavers

36 search results - page 7 / 8
» Intersection Type Systems and Explicit Substitutions Calculi
Sort
View
PPDP
2004
Springer
13 years 11 months ago
Characterizing strong normalization in a language with control operators
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
JLP
2010
96views more  JLP 2010»
13 years 1 months ago
An overview of the K semantic framework
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
Grigore Rosu, Traian-Florin Serbanuta
ICLP
2010
Springer
13 years 10 months ago
Models for Trustworthy Service and Process Oriented Systems
Abstract. Service and process-oriented systems promise to provide more effective business and work processes and more flexible and adaptable enterprise IT systems. However, the t...
Hugo A. López
FOSSACS
2003
Springer
13 years 11 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
PPDP
2007
Springer
14 years 11 days ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana