Nuprl Definition : pcs-to-integer-problem
pcs-to-integer-problem(X) ==
eval L = rev(pcs-mon-vars(X)) in
let polyeqs,polyineqs = X
in eval eqs = evalall(eager-map(λp.linearization(p;L);polyeqs)) in
eval ineqs = evalall(eager-map(λp.linearization(p;L);polyineqs)) in
<eqs, ineqs>
Definitions occuring in Statement :
linearization: linearization(p;L),
pcs-mon-vars: pcs-mon-vars(X),
reverse: rev(as),
eager-map: eager-map(f;as),
evalall: evalall(t),
callbyvalue: callbyvalue,
lambda: λx.A[x],
spread: spread def,
pair: <a, b>
Definitions occuring in definition :
reverse: rev(as),
pcs-mon-vars: pcs-mon-vars(X),
spread: spread def,
callbyvalue: callbyvalue,
evalall: evalall(t),
eager-map: eager-map(f;as),
lambda: λx.A[x],
linearization: linearization(p;L),
pair: <a, b>
FDL editor aliases :
pcs-to-integer-problem
Latex:
pcs-to-integer-problem(X) ==
eval L = rev(pcs-mon-vars(X)) in
let polyeqs,polyineqs = X
in eval eqs = evalall(eager-map(\mlambda{}p.linearization(p;L);polyeqs)) in
eval ineqs = evalall(eager-map(\mlambda{}p.linearization(p;L);polyineqs)) in
<eqs, ineqs>
Date html generated:
2016_05_14-AM-07_11_26
Last ObjectModification:
2015_09_22-PM-05_53_11
Theory : omega
Home
Index