Projects funded by the NCN
Theoretical foundations of interactive theorem provers with unrestricted recursive definitions
2012/07/N/ST6/03398
Keywords:
interactive theorem provers illative combinatory logic lambda calculus program verification
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
- ST1_1: Logic and foundations
- ST1_15: Mathematical aspects of computer science
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: PRELUDIUM 4 - announced on 2012-09-15
Amount awarded: 86 600 PLN
Project start date (Y-m-d): 2013-07-11
Project end date (Y-m-d): 2016-01-10
Project duration:: 30 months (the same as in the proposal)
Project status: Project settled
Equipment purchased [PL]
- komputer przenośny (6 000 PLN)
Information in the final report
- Articles in post-conference publications (3)
- A coinductive confluence proof for infinitary lambda-calculus.Authors:Łukasz CzajkaConference:RTA-TLCA 2014 (rok: 2014, ), Wydawca: SpringerData:konferencja 14-17.07.2014Status:Published
- Confluence of an extension of Combinatory Logic by Boolean constantsAuthors:Łukasz CzajkaConference:FSCD 2017 (rok: 2017, ), Wydawca: LIPIcsData:konferencja 03.09-09.09Status:Published
- Confluence of nearly orthogonal infinitary term rewriting systemsAuthors:Łukasz CzajkaConference:RTA 2015 (rok: 2015, ), Wydawca: LIPIcsData:konferencja 29.06.2015-01.07.2015Status:Published