A computation model for executable higher-order algebraic specification languages.

Jouannaud, J. -., & Okada, M. (1991). A computation model for executable higher-order algebraic specification languages. Proceedings of the 6th IEEE Symposium on Logic in Computer Science (LICS '91), 350-361.

Type

Conference paper

Intellectual base

Primary research

Year

1991

Pages

350-361

DOI registrant

Institute of Electrical and Electronics Engineers

Link

https://doi.org/10.1109/lics.1991.151659matched

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Primes

• Well-Foundedness (Well-Ordering)
  • Listed in the references but not attached to a specific claim.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:0b25791718e9 · see in the full table