Back to Results
First PageMeta Content
Computer science / Formal languages / Applied mathematics / Finite-state machine / Nondeterministic finite automaton / Deterministic finite automaton / Deterministic automaton / Computability / Regular language / Automata theory / Models of computation / Theoretical computer science


Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt
Add to Reading List

Document Date: 2011-10-19 08:09:32

Open Document

File Size: 263,64 KB

Share Result on Facebook

City

Pune / /

Company

Oracle / /

IndustryTerm

relational computing paradigm / non-deterministic relational search fits / bottom-up search / search space / cartesian product / non-deterministic search / /

Person

Robin Milner / Samuel Eilenberg / Peter Landin / /

Position

author / Coq proof assistant / /

ProgrammingLanguage

ISWIM / Objective Caml / ML / Prolog / /

ProvinceOrState

Maharashtra / /

Technology

functional programming / simulation / /

SocialTag