YukonModule.VCVio.OracleComp.RunIO.part0
DefinitionYukon_103f1b0cd9116d3cfa5b22ebbetter-codes
Source module VCVio.OracleComp.RunIO.
Definition code
/-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
module
public import Definitions.Def_Yukon_3ca8dea642d23c4bd0e25cee
public import Batteries.Control.OptionT
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.Vector.Defs
public import Mathlib.Data.Finset.Card
public import Init
public import Mathlib.CategoryTheory.Monad.Types
public import Mathlib.Order.CompleteLattice.Basic
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import Batteries.Control.AlternativeMonad
public import Mathlib.Data.PFunctor.Multivariate.Basic
public import Mathlib.Data.PFunctor.Univariate.Basic
public import Mathlib.Tactic.Common
public import Mathlib.Init
public import Lean.Message
public import Batteries.Tactic.Lint.Basic
public import Batteries.Tactic.Lint
public import Mathlib.Algebra.Polynomial.Eval.Defs
public import Mathlib.Algebra.MvPolynomial.Eval
meta import Definitions.Def_Yukon_3ca8dea642d23c4bd0e25cee
set_option backward.isDefEq.respectTransparency.types false
/-!
# Executing Computations
This file defines a function `runIO` for executing a `ProbComp` in the `IO` monad.
We add this embedding as a `MonadLift` instance, so `#eval` notation works.
-/
@[expose] public section
open OracleSpec
namespace OracleComp
/-- Represent a `ProbComp` via the `IO` monad, allowing actual execution. -/
protected def runIO {α : Type} (oa : ProbComp α) : IO α :=
simulateQ (spec := unifSpec) (fun n => Fin.ofNat (n + 1) <$> (IO.rand 0 n).toIO) oa
/-- Automatic lifting of probabilistic computations into `IO`. -/
instance _root_.OracleComp.instMonadLiftProbCompIO : MonadLift ProbComp IO where monadLift := OracleComp.runIO
def test1 : ProbComp (ℕ × ℕ × ℕ) := do
let x ← $[0..1618]
let y ← $[0..3141]
return (x, y, x + y)
def test2 (n : ℕ) : ProbComp (List ℕ) := do
match n with
| 0 => return []
| n + 1 => return (← $[0..100]) :: (← test2 n)
def test3 (n : ℕ) : ProbComp (List ℕ) := do
let mut xs := []
for _ in List.range n do
xs := (← $[0..100]) :: xs
return xs
def test4 (n : ℕ) : ProbComp (List ℕ) := do
(List.replicate n ()).mapM (fun () => Fin.val <$> ($[0..100]))
end OracleComp
Source