The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
within the lambda-sigma calculus. ... Summary: “We define a novel inference system for strictness and totality analysis for the simply-typed lazy lambda-calculus with constants and fixpoints. ...
This paper discusses the DPoPb's theoretical and practical advantages when using inductive types and lambda-calculus. ... Most of the existing systems adopt the standard algebraic approach where graphs are attributed using sigma-algebras. ... Lambda-terms can be easily expressed in a functional programming which is based also on lambda-calculus. ...doi:10.14279/tuj.eceasst.32.511 dblp:journals/eceasst/TranPDFS10 fatcat:cxme6lkusnexddfpklmq5anbta
We present a treatment of the software issues that arise from this kind of mixing of languages within one system and we discuss issues relevant to the portability of our virtual machine emulator across ... Lambda Prolog achieves its functionality by extending a Prolog-like language by using typed lambda terms as data structures that it then manipulates via higher-order unification and some new program-level ... First, the implementation discussed so far assumes a monomorphic type system for our language, within which no runtime processing of types is necessary. ...arXiv:0911.5203v1 fatcat:6d2kzgj6b5d5th6dhiijcv4mqe
To formalize the soundness of the system we introduce System FR, a calculus supporting System F polymorphism, dependent refinement types, and recursive types (including recursion through contravariant ... Through the use of sized types, System FR supports reasoning about termination of lazy data structures such as streams. ... We have presented System FR, a formalized type system and a bidirectional type checking algorithm that can serve as a basis of a verifier for higher-order functional programs. ...arXiv:1904.03482v1 fatcat:loszinmfq5g6zirzku2pfr626m
BRICS Report Series
The interpretation can be used to compare and contrast<br />the Imperative and the Functional Object Calculi, and to prove properties<br />about them, within a unified framework. ... The proof of computational<br />adequacy makes use of (a pi-calculus version) of ready simulation, and of a<br />factorisation of the interpretation into a functional part and a very simple<br />imperative ... For the semantics of the π-calculus we adopt a labelled transition system. ...doi:10.7146/brics.v5i52.19498 fatcat:7blai4535zettkatuwaqny3veu
, automatic memory management and garbage collection; the Java Virtual Machine and Microsoft's Common Language Infrastructure (also known as .NET); and reflection and runtime code generation using these ... To understand memory organization of classic imperative languages, we also study a small subset of C with arrays, pointer arithmetics, and recursive functions. ... The lambda calculus The lambda calculus is the simplest possible functional language, with only three syntactic constructs: variable, functions, and function applications. ...doi:10.1145/1480828.1480854 fatcat:pnqy47ts5jca5jewjextf5f7m4
a runtime penalty). ... Our work is an exercise in dependently typed generic programming, and internalizes the process of zero-cost reuse as the identity function in a Curry-style theory. ... After erasure, Cedille programs consist of untyped lambda calculus terms. ...arXiv:1803.08150v3 fatcat:rikseeff6bb7hcvs6ge634jfba
The intuitionistic evaluation relation e ⇓ v is a standard call-by-name big-step evaluation relation for the lambda calculus. ... Y, with a lambda-abstraction and function application as its introduction and elimination rules; the dependent pair Σx : X. ...doi:10.1145/2676726.2676969 dblp:conf/popl/KrishnaswamiPB15 fatcat:3sswpdyi4ngdroooaqcqyvnqhm
The intuitionistic evaluation relation e ⇓ v is a standard call-by-name big-step evaluation relation for the lambda calculus. ... Y, with a lambda-abstraction and function application as its introduction and elimination rules; the dependent pair Σx : X. ...doi:10.1145/2775051.2676969 fatcat:k74ipqhvlvgt5fzww7zajmaayy
This allows the user to specify formal systems within the logical framework LF and index ML types with contextual LF objects. ... We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a restricted form of dependent ... Closure-based evaluator for the lambda-calculus We begin with a demonstration of a closure-based evaluator for the untyped lambda-calculus which is directly comparable to that of Licata and Harper [2009 ...doi:10.1145/2103621.2103705 fatcat:k67r2cjk4jf5xbh77h2sd3dkkq
This allows the user to specify formal systems within the logical framework LF and index ML types with contextual LF objects. ... We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a restricted form of dependent ... Closure-based evaluator for the lambda-calculus We begin with a demonstration of a closure-based evaluator for the untyped lambda-calculus which is directly comparable to that of Licata and Harper [2009 ...doi:10.1145/2103656.2103705 dblp:conf/popl/CaveP12 fatcat:t4gosmfs5zb2lpk5ooi52e4iui
TensorFlow Distributions has proven an important part of the TensorFlow toolkit within Google and in the broader deep learning community. ... They are the workhorse behind deep probabilistic programming systems like Edward and empower fast black-box inference in probabilistic models built on deep-network components. ... 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. ...arXiv:1711.10604v1 fatcat:ka5mhdtxczb6lhmx6ir6bg2z7y
Lecture Notes in Computer Science
inexorably approaches the window, behind which perches a fluttering bird. As inexorable, I suppose, as my clambering, noisy, "whatcha looking at, Simon?", clodhopping entrance. I try, Simon! ... As with the lambda calculus, the core of Scheme consists of lambda, which creates function closures, and if, for conditional execution. ... :modes (kappa sigma rho) :is-constant? (lambda(instance) (in-mode? ...doi:10.1007/bfb0032680 fatcat:siqubxgnfnbwfblw53oluicaie
Our primary contribution is a proof of noninterference for a polyvariant variation of the Dependency Core Calculus of Abadi et al. in the Calculus of Constructions. ... The proof is modular: it leverages parametricity for the Calculus of Constructionsand the encoding of data abstraction using existential types.This perspective gives rise to simple and understandable proofs ... This work was supported by the Wallenberg Artificial Intelligence, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation. ...doi:10.1145/3341693 fatcat:srw3vl4elvanhbg7dir5vfdob4
(English summary) 99f:68026 Hardin, Thérése (with Maranget, Luc; Pagano, Bruno) Functional runtime systems within the lambda-sigma calculus. ... (with Klop, Jan Willem) Lambda calculus with explicit recursion. (English summary) 99¢:68031 — (with Felleisen, Matthias) The call-by-need lambda calculus. (English summary) 99g:68024 Arvind? ...
« Previous Showing results 1 — 15 out of 74 results