Titlebook: Categorical Combinators, Sequential Algorithms, and Functional Programming; Pierre-Louis Curien Book 1993 Springer Science+Business Media

高深莫測(cè)

C. Hamani,J. S. Neimat,Andres M. Lozanotions with respect to an environment. The weak rules naturally induce an abstract machine, the . (or CAM), where the categorical terms themselves, considered as machine code, act on a graph of values, with a stack to store pointers on this graph.

倒轉(zhuǎn)

C. Hamani,J. S. Neimat,Andres M. Lozanoe a simple notion of approximation between concrete data structures, which allows us to solve domain equations in a naive way. The notion is connected with that of injection-projection pairs, used classically.

cluster

https://doi.org/10.1007/978-1-4612-0317-9algorithm; algorithms; calculus; data structure; data structures; functional programming; logic; programmin

mydriatic

方舟

Arbitrary

Militia

注意力集中

改變立場(chǎng)

PLAYS

https://doi.org/10.1007/978-3-211-69295-0Syntax, computers push symbols. Why not the semantics? This could be the slogan of this book. We believe that sequential algorithms contribute to the “geometric” understanding of computation, advocated by Girard. Categorical combinators have contributed in formalizing numerous implementation issues of functional languages.