Skip to search formSkip to main contentSkip to account menu

Call-by-push-value

In programming language theory, the call-by-push-value (CBPV) paradigm, inspired by monads, allows writing semantics for lambda-calculus without… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Lambda calculus
Monad (functional programming)Programming language theoryReduction strategy (lambda calculus)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Proceedings of the 7th Workshop on Mathematically Structured Functional Programming, MSFP@FSCD 2018, Oxford, UK, 8th July 2018
2017
2017
Quantitative Semantics for Probabilistic Programming (Invited Talk)
Probabilistic programming has many applications in statistics, physics, ... so that all programming languages have been equipped… 
2016
2016
Proceedings 6th Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2016, Eindhoven, Netherlands, 8th April 2016
  • MSFP@ETAPS
  • 2016
  • Corpus ID: 264963759
2015
2015
Certification de programmes avec des effets calculatoires
Dans cette these, nous visons a formaliser les effets calculatoires. En effet, les langages de programmation les plus utilises… 
2015
2015
Certifications of programs with computational effects. (Certification de programmes avec des effets calculatoires)
In this thesis, we aim to formalize the effects of a computation. Indeed, most used programming languages involve different sorts… 
2013
2013
Categories and types for axiomatic domain theory
Domain Theory provides a denotational semantics for programming languages and calculi containing fixed point combinators and… 
2007
2007
A Proof of Strong Normalization for Call-by-push-value
The call-by-push-value (CBPV) calculus is a general framework within which one can study computational effects such as state…