Filters








764 Hits in 3.6 sec

From Theory to Systems: A Grounded Approach to Programming Language Education [article]

Will Crichton
2019 arXiv   pre-print
By contrast, a student who learns the lambda calculus can understand functions solely as abstraction of code over a single variable (along with variable scope).  ...  For this assignment, students implement a polymorphic collections library in OCaml and translate their implementation by hand into typed lambda calculus.  ... 
arXiv:1904.06750v1 fatcat:qukc3k54gjcvpdx3a4ritzfua4

From Theory to Systems: A Grounded Approach to Programming Language Education

Will Crichton, Michael Wagner
2019 Summit on Advances in Programming Languages  
By contrast, a student who learns the lambda calculus can understand functions solely as abstraction of code over a single variable (along with variable scope).  ...  For this assignment, students implement a polymorphic collections library in OCaml and translate their implementation by hand into typed lambda calculus.  ... 
doi:10.4230/lipics.snapl.2019.4 dblp:conf/snapl/Crichton19 fatcat:6x3mz7coc5hjfbrchidbv7dbea

A compositional theory for STM Haskell

Johannes Borgström, Karthikeyan Bhargavan, Andrew D. Gordon
2009 Proceedings of the 2nd ACM SIGPLAN symposium on Haskell - Haskell '09  
A single reduction relation captures both pure functional computations and also effectful computations in the STM and I/O monads.  ...  The core of our theory is a uniform model, in the spirit of process calculi, of the run-time state of multi-threaded STM Haskell programs.  ...  As a basis for reasoning about this code, we present a core calculus for STM Haskell: a concurrent non-strict lambda calculus with transactional variables and atomic blocks.  ... 
doi:10.1145/1596638.1596648 dblp:conf/haskell/BorgstromBG09 fatcat:ymlpojn6b5dedegpvvn4lpy2i4

A concurrent lambda calculus with futures

J. Niehren, J. Schwinghammer, G. Smolka
2006 Theoretical Computer Science  
We introduce a new lambda calculus with futures, (fut), that models the operational semantics of concurrent statically typed functional programming languages with mixed eager and lazy threads such as Alice  ...  This fragment assumes the absence of so called handle errors that violate the single assignment assumption of (fut)'s handled future-construct.  ...  In this article, we present a new lambda calculus with futures that we call (fut).  ... 
doi:10.1016/j.tcs.2006.08.016 fatcat:sysva7dtjzenpntls2u435kklu

Selected Extended Papers of ITP 2017

Mauricio Ayala-Rincón, César Muñoz
2018 Journal of automated reasoning  
Yannick Forster and Gert Smolka, in Call-by-Value Lambda Calculus as a Model of Computation in Coq, present the programming language L, a subsystem of the λ-calculus with a weak head and call-by-value  ...  future compiler stack, balancing low-level features for executability and high-level features to ease proofs, devising a rely-guarantee program logic that allows for an incremental proof and decouples single-thread  ... 
doi:10.1007/s10817-018-09500-0 fatcat:no6wykx3jrdphd2kalkgqnocqi

Sketch-Guided Equality Saturation: Scaling Equality Saturation to Complex Optimizations of Functional Programs [article]

Thomas Koehler, Phil Trinder, Michel Steuwer
2022 arXiv   pre-print
Equality saturation has some limitations when rewriting functional language terms, as currently naive encodings of the lambda calculus are used.  ...  We present new techniques for encoding polymorphically typed lambda calculi, and show that the efficient encoding reduces the runtime and memory consumption of equality saturation by orders of magnitude  ...  Specifically for our Rise use case, we apply the techniques to a polymorphically typed lambda calculus.  ... 
arXiv:2111.13040v2 fatcat:kt4ap2tdvzbqlaeshxv4pfxh74

Frontmatter, Table of Contents, Preface, Workshop Organization

Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, Yuki Chiba, Marc Herbstritt
2014 International Conference on Rewriting Techniques and Applications  
This paper presents a call-by-need polymorphically typed lambda-calculus with letrec, case, constructors and seq. The typing of the calculus is modelled in a system-F style.  ...  We demonstrate our technique by verifying the correctness of a redundant store elimination optimization in a simple LLVM-like intermediate language, relying on a theorem that allows us to lift single-thread  ... 
doi:10.4230/oasics.wpte.2014.i dblp:conf/rta/X14 fatcat:irftn5gdzjgyrh37ff5n3ir334

FUNCTIONAL PEARL Pickler combinators

ANDREW J. KENNEDY
2004 Journal of functional programming  
Here is another example: a pickler for terms in the untyped lambda calculus.  ...  With heterogeneous structures such as the Lambda type defined above, it becomes much harder to thread the state explicitly.  ... 
doi:10.1017/s0956796804005209 fatcat:crymzilcsfhfffzmwn4a7bwn3i

A Type System for Dynamic Delimited Continuations

Takuo Yonezawa, Yukiyoshi Kameyama
2008 IPSJ Digital Courier  
We also introduce let-polymorphism into our type system, and show that our type system satisfies several important properties such as strong type soundness.  ...  The source calculus of the dynamic CPS transformation is the call-byvalue lambda calculus with control and prompt given in the previous section, and its target calculus is the lambda calculus with lists  ...  In a typical case, the source calculus is a lambda calculus with control operators, and the target calculus is one without.  ... 
doi:10.2197/ipsjdc.4.182 fatcat:2tli5fxalrc73hd24ehkmpdm6y

Assignments for applicative languages [chapter]

Vipin Swarup, Uday S. Reddy, Evan Ireland
1991 Lecture Notes in Computer Science  
This reflects the requirement that manipulations of state should be performed in a sequential fashion, similar in spirit to the proposal of single-threaded lambda calculus [GH90] .  ...  Guzman and Hudak [GH90] propose a typed extension of functional languages called single threaded lambda calculus that can express the sequencing constraints required for the in-place update of array-like  ... 
doi:10.1007/3540543961_10 fatcat:a5s2pzsrefanrk5mn3hrusjjgq

Assignments for Applicative Languages [chapter]

Vipin Swarup, Uday S. Reddy, Evan Ireland
1997 Algol-like Languages  
This reflects the requirement that manipulations of state should be performed in a sequential fashion, similar in spirit to the proposal of single-threaded lambda calculus [GH90] .  ...  Guzman and Hudak [GH90] propose a typed extension of functional languages called single threaded lambda calculus that can express the sequencing constraints required for the in-place update of array-like  ... 
doi:10.1007/978-1-4612-4118-8_10 fatcat:vuhojkzyargwdkl7mywoiw3yz4

Hypergames and full completeness for system F (rough draft) [article]

Dominic Hughes
2008 arXiv   pre-print
Lambda calculus games Let λ λ λ denote the types of λ calculus generated from a single base type X by implication →.  ...  model of untyped lambda calculus.  ... 
arXiv:0801.2575v1 fatcat:guswll2hkfcrngz3bmuakx3v2i

A Typed Slicing Compilation of the Polymorphic RPC Calculus [article]

Kwanghoon Choi, James Cheney, Sam Lindley, Bob Reynders
2021 arXiv   pre-print
We develop an experimental programming language based on the polymorphic RPC calculus. We introduce a polymorphic Client-Server (CS) calculus with the client and server parts separated.  ...  We design a type-based slicing compilation of the polymorphic RPC calculus into this CS calculus, proving type and semantic correctness.  ...  The existing slicing compilation method for the typed RPC calculus [4] , that is the simply typed and monomorphic subset of the polymorphic RPC calculus [5] , cannot deal with such a polymorphic lambda  ... 
arXiv:2107.10793v2 fatcat:aexrehtsfre6hddwvhsao2zo7a

Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion

G.M. Bierman, A.M. Pitts, C.V. Russo
2001 Electronical Notes in Theoretical Computer Science  
Plotkin has advocated the combination of linear lambda calculus, polymorphism and fixed point recursion as an expressive semantic metalanguage.  ...  We show that the naturally call-by-value operators of linear lambda calculus can be given a call-by-name semantics without affecting termination at exponential types and hence without affecting ground  ...  calculus, polymorphism and recursion.  ... 
doi:10.1016/s1571-0661(04)80874-0 fatcat:tpou5kcubrawvldgy5m44dqsiy

Type-Directed Partial Evaluation

Olivier Danvy
1995 DAIMI Report Series  
As such, type-directed partial evaluation essentially achieves lambda-calculus normalization.  ...  Its restriction to the simply typed lambda-calculus coincides with Berger and Schwichtenberg's "inverse of the evaluation functional´´ (LICS'91), which is an instance of normalization in a logical setting  ...  Single-threading and computation duplication must be addressed Type-directed partial evaluation does not escape the problem of computation duplication: a program such a s lambda f g x lambda y f y y g  ... 
doi:10.7146/dpb.v24i494.7022 fatcat:vioyao7qrrbljnnppgwr3ig7ce
« Previous Showing results 1 — 15 out of 764 results