Typed Combinators for Generic Traversal

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45587-6_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Interaction Combinators

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1997English

Categorical Multi-Combinators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

Combinators for Message-Passing in Haskell

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Intrinsically-Typed Definitional Interpreters for Linear, Session-Typed Languages

2020English

Termination Combinators Forever

2011English

Traversal Algorithm for Complete Coverage

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2012English

Competitive Algorithms for Layered Graph Traversal

SIAM Journal on Computing
MathematicsComputer Science
1998English

Session Traversal Utilities for NAT (STUN)

2008English

Universal Traversal Sequences for Expander Graphs

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy