Sciweavers

111 search results - page 18 / 23
» A Proof of Strong Normalisation using Domain Theory
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 2 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
POPL
2010
ACM
14 years 4 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
COLING
2000
13 years 8 months ago
XML and Multilingual Document Authoring: Convergent Trends
Typical approaches to XML authoring view a XML document as a mixture of structure (the tags) and surface (text between the tags). We advocate a radical approach where the surface ...
Marc Dymetman, Veronika Lux, Aarne Ranta
SIAMNUM
2010
129views more  SIAMNUM 2010»
13 years 2 months ago
Convergence of an Adaptive Finite Element Method for Controlling Local Energy Errors
A number of works concerning rigorous convergence theory for adaptive finite element methods (AFEM) for controlling global energy errors have appeared in recent years. However, man...
Alan Demlow
AC
2000
Springer
13 years 11 months ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier