Probabilistic approach to the lambda definability for fourth order types

zbMATH Open1272.03083MaRDI QIDQ2851692FDOQ2851692

Authors: Marek Zaionc 

Publication date: 2 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S157106610505125X

Recommendations

• A Type Theory for Probabilistic $$\lambda $$–calculus
• On Probabilistic λ-Calculi
• Probabilistic reasoning about simply typed lambda terms
• A probabilistic semantics for the pure \(\lambda\)-calculus
• Fully abstract models of the probabilistic \(\lambda\)-calculus
• Probabilistic operational semantics for the lambda calculus
• A finite axiomatization of propositional type theory in pure lambda calculus
• Towards probabilistic reasoning in type theory -- the intersection type case
• An infinitary probability logic for type spaces
• scientific article; zbMATH DE number 992007

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (5)

• Loader and Urzyczyn are logically related
• Title not available (Why is that?)
• On the expressive power of schemes
• Regular matching and inclusion on compressed tree patterns with constrained context variables
• Asymptotic densities in logic and type theory

This page was built for publication: Probabilistic approach to the lambda definability for fourth order types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851692)