Back to Results
First PageMeta Content
Functions and mappings / Function / Prolog / Constraint logic programming / Unification / Multiplication / FO / Constructible universe / Mathematics / Mathematical logic / Logic programming


Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)? Oleg Kiselyov1 , William E. Byrd2 , Daniel P. Friedman2 , and Chung-chieh Shan3 1
Add to Reading List

Document Date: 2013-12-02 09:16:44

Open Document

File Size: 191,33 KB

Share Result on Facebook

/

Facility

Indiana University / /

IndustryTerm

arithmetic solutions / search strategy / logic systems / logic programming systems / breadth-first search / search tree / singleton solution / finite solution / search space / depth-first search / empty solution / search depth / /

Organization

Indiana University / Rutgers University / /

Person

Ronald Garcia / /

/

ProgrammingLanguage

Haskell / Prolog / Datalog / /

URL

http /

SocialTag