Termination of SystemF-bounded: A Complete Proof

Information and Computation - United States
doi 10.1006/inco.1997.2662
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Proof Pearl: The Termination Analysis of Terminator

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Graph Decomposition Is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
MathematicsComputer Science
1997English

A Complete Bounded Complex Submanifold of C 3

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1979English

Bounded Sets in Fast Complete Inductive Limits

International Journal of Mathematics and Mathematical Sciences
Mathematics
1984English

A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1981English

A New Set of Postulates for Betweenness, With Proof of Complete Independence

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1924English

Curvature Estimates for Complete and Bounded Submanifolds in a Riemannian Manifold

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1981English

A Complete Characterization of Termination of 0 P 1 Q → 1 R 0 S

Applicable Algebra in Engineering, Communications and Computing
Applied MathematicsNumber TheoryAlgebra
2000English

Complete Multipartite Graphs Are Determined by Their Distance Spectra: A Short Proof

DEStech Transactions on Computer Science and Engineering
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy