Amanote Research

Amanote Research

    RegisterSign In

Unification With Lazy Non-Redundant Copying

doi 10.3115/981344.981386
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1991

Authors
Martin C. Emele
Publisher

Association for Computational Linguistics


Related search

Decomposing Non-Redundant Sharing by Complementation

Theory and Practice of Logic Programming
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceArtificial IntelligenceSoftware
2002English

Two Loop Unification of Non-Susy SO(10) GUT With TeV Scalars

Physical Review D
AstronomyPhysics
2017English

Public-Key Encryption With Lazy Parties

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2016English

Lazy Arithmetic

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1997English

GASP: Answer Set Programming With Lazy Grounding

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Practical Typed Lazy Contracts

ACM SIGPLAN Notices
Computer Science
2012English

Dispense With Redundant P Values

Nature
Multidisciplinary
2018English

On the Non-Redundant Roles Of TDO2 and IDO1

Frontiers in Immunology
AllergyImmunology
2014English

A Max-Sat Solver With Lazy Data Structures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy