Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation

Type Assigment Systems for Lambda Calculi and for the Lambda Calculus of Objects

Abstract : This thesis is part of the study of Type Theory for the λ-calculus. It is divided into a "foundational" part and in an "applicative" part: i) The foundational part studies various type assignment systems for the untyped λ-calculus. In particular the main properties of such systems were proved and were considered the relations with the corresponding type systems for the typed λ-calculus and with intuitionistic logic. ii) The applicative part studies a possible extension of the λ-calculus to a language that can be seen as a "paradigm" to study new programming techniques such as object-oriented programming. A type assignment system for such language has been defined and the fundamental properties of the system were proved.
Complete list of metadata

Contributor : Luigi Liquori Connect in order to contact the contributor
Submitted on : Thursday, May 28, 2015 - 1:32:17 PM
Last modification on : Monday, February 7, 2022 - 4:06:03 PM
Long-term archiving on: : Monday, April 24, 2017 - 4:49:50 PM


  • HAL Id : tel-01157160, version 1



Luigi Liquori. Type Assigment Systems for Lambda Calculi and for the Lambda Calculus of Objects. Computation and Language [cs.CL]. Ministère de l'Education Nationale, de la Recherche et de Technologie, Rome, Italy, 1996. English. ⟨tel-01157160⟩



Record views


Files downloads