ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
29
views
5
references
Top references
cited by
10
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,323
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages and Programming
Closed Freyd- and κ-categories
other
Author(s):
John Power
,
Hayo Thielecke
Publication date
(Online):
January 18 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
5
Record
: found
Abstract
: not found
Article
: not found
Premonoidal categories and notions of computation
JOHN POWER
,
EDMUND ROBINSON
(1997)
0
comments
Cited
26
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Computational lambda-calculus and monads
E. Moggi
(2024)
0
comments
Cited
25
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Decomposing typed lambda calculus into a couple of categorical programming languages
Masahito Hasegawa
(1995)
0
comments
Cited
3
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1999
Publication date (Online):
January 18 2002
Pages
: 625-634
DOI:
10.1007/3-540-48523-6_59
SO-VID:
4180572b-6c73-42df-875e-a27d86ee9057
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Generating Hard Instances of the Short Basis Problem
pp. 10
Wide Area Computation
pp. 25
Proof Techniques for Cryptographic Protocols
pp. 40
Type Structure for Low-Level Programming Languages
pp. 55
Real Computations with Fake Numbers
pp. 74
A Model for Associative Memory, a Basis for Thinking and Consciousness
pp. 90
Numerical Integration with Exact Real Arithmetic
pp. 105
Observations about the Nature and State of Computer Science
pp. 106
DNA Computing: New Ideas and Paradigms
pp. 119
Online Data Structures in External Memory
pp. 134
From Computational Learning Theory to Discovery Science
pp. 149
Bounded Depth Arithmetic Circuits: Counting and Closure
pp. 159
Parametric Temporal Logic for “Model Measuring”
pp. 169
Communicating Hierarchical State Machines
pp. 179
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs
pp. 190
General Morphisms of Petri Nets (Extended Abstract)
pp. 200
On Some Tighter Inapproximability Results (Extended Abstract)
pp. 210
Decomposition and Composition of Timed Automata
pp. 220
New Applications of the Incompressibility Method (Extended Abstract)
pp. 230
Mobility Types for Mobile Ambients
pp. 240
Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains
pp. 250
Decidable Fragments of Simultaneous Rigid Reachability
pp. 261
Text Compression Using Antidictionaries
pp. 271
Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)
pp. 281
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
pp. 291
Space-Time Tradeoffs for Graph Properties
pp. 301
Boundedness of Reset P/T Nets
pp. 311
Two-way finite state transducers and monadic second-order logic
pp. 321
Partially Ordered Regular Languages for Graph Queries
pp. 331
Deciding First-Order Properties of Locally Tree-Decomposable Graphs
pp. 341
Comparison of Process Algebra Equivalences Using Formats
pp. 351
Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract)
pp. 361
Computing LOGCFL Certificates
pp. 372
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
pp. 382
On the Complements of Partial k-Trees
pp. 392
Approximation Results for Kinetic Variants of TSP
pp. 402
Distributed Probabilistic Polling and Applications to Proportionate Agreement
pp. 412
Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract)
pp. 422
A Framework for Decidable Metrical Logics
pp. 433
On the Power of Las Vegas II. Two-Way Finite Automata
pp. 443
Stable Marriage with Incomplete Lists and Ties
pp. 453
Average-Case Complexity of Shellsort (Preliminary Version)
pp. 463
Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract)
pp. 473
A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract)
pp. 483
Two Techniques in the Area of the Star Problem
pp. 493
Approximations by OBDDs and the Variable Ordering Problem
pp. 503
Simulation Preorder on Simple Process Algebras
pp. 513
Solos in Concert
pp. 524
Shortest Anisotropic Paths on Terrains
pp. 534
Relations between Local and Global Periodicity of Words (Extended Abstract)
pp. 544
Efficient Merging, Construction, and Maintenance of Evolutionary Trees
pp. 554
Formalizing a Lazy Substitution Proof System for π-Calculus in the Calculus of Inductive Constructions
pp. 565
Leader Election by d Dimensional Cellular Automata
pp. 575
New Upper Bounds for MaxSat
pp. 585
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ⋆
pp. 595
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
pp. 605
Finite Automata with Generalized Acceptance Criteria
pp. 615
A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract)
pp. 625
Closed Freyd- and κ-categories
pp. 635
Typed Exceptions and Continuations Cannot Macro-Express Each Other
pp. 645
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract)
pp. 655
Accessing Multiple Sequences Through Set Associative Caches
pp. 665
T(A) = T(B)?
pp. 676
Many-Valued Logics and Holographic Proofs
pp. 687
On the Complexity and Inapproximability of Shortest Implicant Problems
pp. 697
The Wave Propagator Is Turing Computable
pp. 707
An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract)
pp. 717
Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices
Similar content
2,323
Cartesian effect categories are Freyd-categories
Authors:
Dominique Duval
,
Jean-Claude Reynaud
,
Jean-Guillaume Dumas
ON FREYD'S GENERATING HYPOTHESIS
Authors:
Mark Hovey
Freyd categories are Enriched Lawvere Theories
Authors:
Sam Staton
See all similar
Cited by
10
Adequacy for Algebraic Effects
Authors:
Gordon D. Plotkin
,
John Power
A Game Semantics of the Asynchronous π-Calculus
Authors:
Jim Laird
Programming with Arrows
Authors:
John Hughes
See all cited by