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

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

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