Amanote Research

Amanote Research

    RegisterSign In

Datatype Laws Without Signatures

Mathematical Structures in Computer Science - United Kingdom
doi 10.1017/s0960129500000852
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsComputer Science Applications
Date

February 1, 1996

Authors
Maarten M. Fokkinga
Publisher

Cambridge University Press (CUP)


Related search

Parametric Datatype-Genericity

2009English

Short Signatures Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures From Lattices Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Automatic Datatype Generation and Optimization

ACM SIGPLAN Notices
2012English

Revolution Without Reform? A Critique of Egypt's Election Laws

SSRN Electronic Journal
2012English

Realism Without Truth: A Review of Giere's Science Without Laws and Scientific Perspectivism

Journal of the Experimental Analysis of Behavior
Behavioral NeuroscienceExperimentalCognitive Psychology
2009English

Web Ontology Reasoning With Datatype Groups

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Semantic Web Datatype Inference: Towards Better RDF Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

De Bruijn Notation as a Nested Datatype

Journal of Functional Programming
Software
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy