| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
PlutusIR.Compiler.Recursion
Description
Functions for compiling PIR recursive let-bound functions into PLC.
Synopsis
- compileRecTerms ∷ Compiling m e uni fun a ⇒ PIRTerm uni fun a → NonEmpty (TermDef TyName Name uni fun (Provenance a)) → DefT SharedName uni fun (Provenance a) m (PIRTerm uni fun a)
- mkFixpoint ∷ ∀ m e uni fun a. Compiling m e uni fun a ⇒ NonEmpty (TermDef TyName Name uni fun (Provenance a)) → DefT SharedName uni fun (Provenance a) m (Tuple (Term TyName Name uni fun) uni (Provenance a))
Documentation
compileRecTerms ∷ Compiling m e uni fun a ⇒ PIRTerm uni fun a → NonEmpty (TermDef TyName Name uni fun (Provenance a)) → DefT SharedName uni fun (Provenance a) m (PIRTerm uni fun a) Source #
Compile a mutually recursive list of var decls bound in a body.
mkFixpoint ∷ ∀ m e uni fun a. Compiling m e uni fun a ⇒ NonEmpty (TermDef TyName Name uni fun (Provenance a)) → DefT SharedName uni fun (Provenance a) m (Tuple (Term TyName Name uni fun) uni (Provenance a)) Source #
Given a list of var decls, create a tuples of values that computes their mutually recursive fixpoint.