Free theorems in the presence of seq

Johann, P., & Voigtländer, J. (2004). Free theorems in the presence of seq. Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages.

Type

Conference paper

Intellectual base

Primary research

Year

2004

DOI

10.1145/964001.964010

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/964001.964010

Cited by

1 citation across 1 artifact.

Domain-specific

• Parametricity
  • … between constitutive identity and a convenient observable transfers from A total function of type forall A. A to A can only return its input under standard pure parametric semantics. to A proof states termination, effects, runtime type inspection and language features that can invalidate the simple theorem..

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

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:b9f22624fe5b · see in the full table