Non-determinism, Non-termination and the Strong Normalization of System T-Reference-Cited by-同舟云学术

Non-determinism, Non-termination and the Strong Normalization of System T

Published:2013 Issue: Volume: Page:31-47
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Aschieri Federico,Zorzi Margherita

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-38946-7_5

Reference22 articles.

1. Aschieri, F.: Una caratterizzazione dei lambda termini non fortemente normalizzabili. Master Degree Thesis, Università degli Studi di Verona (2007)

2. Biasi, C., Aschieri, F.: A Term Assignment for Polarized Bi-Intuitionistic Logic and its Strong Normalization. Fundamenta Informaticae 84(02) (2008)

3. Dal Lago, U., Zorzi, M.: Probabilistic Operational Semantics for the Lambda Calculus. RAIRO-ITA 46(03), 413–450 (2012), doi:10.1051/ita/2012012

4. David, R., Nour, K.: A short proof of the strong normalization of the simply typed lambda-mu-calculus. Schedae Informaticae 12, 27–34 (2003)

5. de’ Liguoro, U., Piperno, A.: Non-Deterministic Extensions of Untyped Lambda-Calculus. Information and Computation 122, 149–177 (1995)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum Programming Made Easy;Electronic Proceedings in Theoretical Computer Science;2019-04-15

2. QPCF: Higher-Order Languages and Quantum Circuits;Journal of Automated Reasoning;2019-03-13

3. “It Could Be Worse, It Could Be Raining”: Reliable Automatic Meteorological Forecasting for Holiday Planning;Lecture Notes in Computer Science;2019

4. It could rain: weather forecasting as a reasoning process;Procedia Computer Science;2018

5. RELATIONAL GRAPH MODELS AT WORK;LOG METH COMPUT SCI;2018