Results 61 to 70 of about 332,400 (128)
Equivalence of call-by-name and call-by-need for lambda-calculi with letrec [PDF]
, 2006 We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped with contextual equivalence the call-by-name and the call-by-need evaluation are equivalent, and also that the unrestricted copy-operation is correct ...
Schmidt-Schauß, Manfred
core +2 more sources
Deciding equivalence with sums and the empty type [PDF]
arXiv, 2016 The logical technique of focusing can be applied to the $\lambda$-calculus; in a simple type system with atomic types and negative type formers (functions, products, the unit type), its normal forms coincide with $\beta\eta$-normal forms. Introducing a saturation phase gives a notion of quasi-normal forms in presence of positive types (sum types and ...
arxiv
Graphical workstation capability for reliability modeling [PDF]
In addition to computational capabilities, software tools for estimating the reliability of fault-tolerant digital computer systems must also provide a means of interfacing with the user.
Bavuso, Salvatore J. +2 more
core +1 more source
Normalisation by Traversals [PDF]
arXiv, 2015 We present a novel method of computing the beta-normal eta-long form of a simply-typed lambda-term by constructing traversals over a variant abstract syntax tree of the term. In contrast to beta-reduction, which changes the term by substitution, this method of normalisation by traversals leaves the original term intact.
arxiv
Deep Probabilistic Programming Languages: A Qualitative Study [PDF]
arXiv, 2018 Deep probabilistic programming languages try to combine the advantages of deep learning with those of probabilistic programming languages. If successful, this would be a big step forward in machine learning and programming languages. Unfortunately, as of now, this new crop of languages is hard to use and understand.
arxiv
A Lambda-Calculus with letrec, case, constructors and non-determinism [PDF]
arXiv, 2000 A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost reduction. The semantics is defined by contextual equivalence of expressions instead of using $\alpha\beta(\eta ...
arxiv
AD in Fortran, Part 1: Design [PDF]
, 2012 We propose extensions to Fortran which integrate forward and reverse Automatic Differentiation (AD) directly into the programming model. Irrespective of implementation technology, embedding AD constructs directly into the language extends the reach and ...
Pearlmutter, Barak A. +2 more
core +1 more source
An interactive programme for Steiner trees [PDF]
arXiv, 2012 We introduce a fully written programmed code with a supervised method for generating Steiner trees. Our choice of the programming language, and the use of well-known theorems from Geometry and Complex Analysis, allowed this method to be implemented with only 747 lines of effective source code.
arxiv
A New Approach to Probabilistic Programming Inference [PDF]
, 2015 We introduce and demonstrate a new approach to inference in expressive probabilistic programming languages based on particle Markov chain Monte Carlo. Our approach is simple to implement and easy to parallelize.
Mansinghka, Vikash +2 more
core
Delayed Sampling and Automatic Rao-Blackwellization of Probabilistic Programs
, 2018 We introduce a dynamic mechanism for the solution of analytically-tractable substructure in probabilistic programs, using conjugate priors and affine transformations to reduce variance in Monte Carlo estimators. For inference with Sequential Monte Carlo,
Broman, David +4 more
core