Strong normalisation for applied lambda calculi
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations' are. From this we derive a general normalisation theorem for...
Sábháilte in:
| Príomhchruthaitheoir: | |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Logical Methods in Computer Science e.V.
2005-10-01
|
| Sraith: | Logical Methods in Computer Science |
| Ábhair: | |
| Rochtain ar líne: | https://lmcs.episciences.org/2267/pdf |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|