Sciweavers

632 search results - page 8 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ECOOP
2007
Springer
14 years 1 months ago
Towards correct evolution of components using VPA-based aspects
Abstract. Interaction protocols are a popular means to construct correct component-based systems. Aspects that modify such protocols are interesting in this context because they su...
Dong Ha Nguyen, Mario Südholt
JMLR
2012
11 years 10 months ago
Krylov Subspace Descent for Deep Learning
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
Oriol Vinyals, Daniel Povey
POPL
2009
ACM
14 years 8 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
APAL
2005
90views more  APAL 2005»
13 years 7 months ago
Explicit mathematics: power types and overloading
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
Thomas Studer
ESOP
2010
Springer
14 years 4 months ago
Explicit Stabilisation for Modular Rely-Guarantee Reasoning
Abstract. We propose a new formalisation of stability for Rely-Guarantee, in which an assertion's stability is encoded into its syntactic form. This allows two advances in mod...
John Wickerson, Matthew J. Parkinson, Mike Dodds