A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Functional back-ends within the lambda-sigma calculus

1996
*
SIGPLAN notices
*

##
###
Functional back-ends within the lambda-sigma calculus

1996
*
Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96
*

##
###
Using Hindley-Milner type inference to optimise list representation

1994
*
Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94
*

Lists are a pervasive data structure in

doi:10.1145/182409.156781
dblp:conf/lfp/Hall94
fatcat:c5q5kym5gjevbdmzidkqchvncu
*functional*programs.*The*generality and simplicity of their structure makes them expensive. ... Acknowledgements John Launchbury contributed much to*the*presentation of*the*basic ideas, and made other useful comments, as did*the*conference referees. Dennis Howe, John T. ... For example,*the*polymorphic*function*glue is translated into*the*following form: glue = t. front middle*back*. append t front (append t middle*back*)*The*type variable t is bound by*the*type*lambda*form ...##
###
Using Hindley-Milner type inference to optimise list representation

1994
*
ACM SIGPLAN Lisp Pointers
*

Lists are a pervasive data structure in

doi:10.1145/182590.156781
fatcat:shrnkph6krb6bhmimgcsc4wyke
*functional*programs.*The*generality and simplicity of their structure makes them expensive. ... Acknowledgements John Launchbury contributed much to*the*presentation of*the*basic ideas, and made other useful comments, as did*the*conference referees. Dennis Howe, John T. ... For example,*the*polymorphic*function*glue is translated into*the*following form: glue = t. front middle*back*. append t front (append t middle*back*)*The*type variable t is bound by*the*type*lambda*form ...##
###
Page 8294 of Mathematical Reviews Vol. , Issue 2001K
[page]

2001
*
Mathematical Reviews
*

That is, whenever a dead-

*end*occurs at a particular variable X,,*the*algo- rithm*backs*up to*the*most recent variable connected to X in*the*graph. ... ISBN 90-386-0853-5 From*the*text: “In*the*first part of Chapter 2 we give a rather informal introduction, aimed at those readers that have had some exposure to*lambda*-*calculus*but are not familiar with ...##
###
View-centric reasoning for Linda and Tuple Space computation

2003
*
IEE Proceedings - Software
*

When all processes

doi:10.1049/ip-sen:20030129
fatcat:7fqbvinr3bf2xlcw4lz4mnvdri
*within*a tuple replace themselves with values,*the*formerly active tuple becomes passive. ... When a process completes, it replaces itself*within*its respective tuple with*the*value resulting from its computation. ... In particular, an alternative expression of VCR in*the*alphabetized relational*calculus*would facilitate drawing VCR into Hoare and He's Unifying Theories of Programming [11] , and provide for a more ...##
###
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi

2011
*
Electronical Notes in Theoretical Computer Science
*

*The*system was developed in OCaml and now it can be executed inside

*the*Emacs editor

*within*a new mode which allows a very easy interaction. ... In addition to dealing

*the*λ-

*calculus*and explicit substitutions calculi in de Bruijn notation, now it is possible to work with

*the*λ-

*calculus*and with several calculi of explicit substitutions using also ...

*The*directives #select-output-syntax

*sigma*and #select-input-syntax

*sigma*concerns

*the*definition of

*the*grammar. ...

##
###
Initial Semantics for higher-order typed syntax in Coq
[article]

2011
*
arXiv
*
pre-print

We show that this category has an initial object

arXiv:1012.1010v3
fatcat:lgc23sesczht5a7t4fbpe2aufe
*Sigma*(S). From its construction it will be clear that*the*object*Sigma*(S) merits*the*name abstract syntax associated to S. ... Initial Semantics aims at characterizing*the*syntax associated to a signature as*the*initial object of some category. ... Acknowledgements*The*theorem was implemented in Coq by*the*first author during a stay at Università degli Studi di Firenze, Italy, financially supported by*the*Conseil Général des Alpes-Maritimes CG06. ...##
###
Linear objects: Logical processes with built-in inheritance

1991
*
New generation computing
*

New derivability algorithm in

doi:10.1007/bf03037173
fatcat:qhsukwvkdresrlwwu6s2kvvosa
*the*constructive propositional*calculus*. (In Russian). In Proceedings of*the*Steklov institute of Mathematics (Trudy), v.52, pages 193{225, 1958. 91] P. Wadler. ... On a version of*the*constructive predicate*calculus*without structural rules. Soviet Math. Doklady, 6:416{419, 1965. 80] E.L. Post. Recursive unsolvability of a problem of Thue. ... Future work in*the**functional*language direction involves*the*translation of typed*lambda**calculus*into*the*linear*lambda**calculus*. ...##
###
Towards Self-verification of HOL Light
[chapter]

2006
*
Lecture Notes in Computer Science
*

a set-theoretic semantics

doi:10.1007/11814771_17
fatcat:jockipqsnbb7nimumunsbfhwme
*within*HOL Light itself. ...*The*HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly*functional*OCaml, whose complete formal verification seems to be quite feasible. ...*The*anonymous referees, who evidently read*the*submitted version with great care, provided helpful remarks and caught several errors. ...##
###
TensorFlow Distributions
[article]

2017
*
arXiv
*
pre-print

*The*TensorFlow Distributions library implements a vision of probability theory adapted to

*the*modern deep-learning paradigm of

*end*-to-

*end*differentiable computation. ... TensorFlow Distributions has proven an important part of

*the*TensorFlow toolkit

*within*Google and in

*the*broader deep learning community. ... Acknowledgments We thank Jasper Snoek for feedback and comments, and Kevin Murphy for thoughtful discussions since

*the*beginning of TensorFlow Distributions. DT is supported by a Google Ph.D. ...

##
###
Monadic concurrent linear logic programming

2005
*
Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '05
*

We illustrate its expressive power through several examples including an implementation of

doi:10.1145/1069774.1069778
dblp:conf/ppdp/LopezPPW05
fatcat:wsts6t7gwrgjhigxxnzake77um
*the*pi-*calculus*, a call-byneed*lambda*-*calculus*, and several saturating algorithms presented in logical form. ...*The*resulting language, called LolliMon, has a natural forward chaining, committed choice operational semantics inside*the*monad, while retaining Lolli's semantics outside*the*monad. ... Finally, when evaluation of*the**function*is complete, we can substitute*the*argument into*the**function*body and evaluate*the*result. ...##
###
Dark Particles Answer Dark Energy

2013
*
Journal of Modern Physics
*

Black-body radiation is still present and fits as

doi:10.4236/jmp.2013.47a1010
fatcat:3oml7abjmnavvoaifjtt6v4zni
*the*source of*the*Universe's missing energy. ... density of only 17% more than*the*commonly accepted value. ... Many theories are still under review [6, 7] ; with*the*most accepted being*the**Lambda*Cold Dark Matter model, ΛCDM where*Lambda*,*the*Cosmological Constant, provides a negative pressure , to*the*Universe ...##
###
A Study of Syntactic and Semantic Artifacts and its Application to Lambda Definability, Strong Normalization, and Weak Normalization in the Presence of..

2008
*
BRICS Report Series
*

Church's

doi:10.7146/brics.v15i3.21938
fatcat:jaibmuzs55ftponzsit7y5wpx4
*lambda*-*calculus*underlies*the*syntax (i.e.,*the*form) and*the*semantics (i.e.,*the*meaning) of*functional*programs. ... ., artifacts) in*the**lambda**calculus*. For example, one puts*the*expressive power of*the**lambda**calculus*to*the*test in*the*area of*lambda*definability. ...*Lambda*definability concerns representations of elements and*functions*on elements in*the*λ-*calculus*. ...##
###
Free Theorems Simply, via Dinaturality
[article]

2019
*
arXiv
*
pre-print

It is conceptually appealing and easy to control and implement, as

arXiv:1908.07776v1
fatcat:znjtga5pw5hgtn5tgtsq7spg3a
*the*provided Haskell code shows. ... We present a simple approach for obtaining dinaturality-related free theorems from*the*standard formulation of relational parametricity in a rather direct way. ... Many of*the*ideas here, most notably*the*conjuring lemma (including that name), but also*the*criterion proposed in Section 3.5, originated during past collaboration with Stefan Mehner. ...
« Previous

*Showing results 1 — 15 out of 329 results*