The TLCA List of Open Problems (modeled after the RTA LOOP ) aims at collecting unresolved questions (and other relevant information, e.g. about solutions and related results) in the subject areas of the TLCA (Typed Lambda Calculi and Applications) series of conferences, in particular in the following topics: * Typed and untyped lambda-calculi as models of computation. * Proof-theory: Natural deduction, sequent calculi, cut elimination and normalization. Propositions as types, linear logic and proof nets. * Semantics: Denotational semantics, game semantics, realizability, categorical models. * Programming languages: Foundations of functional and object-oriented programming, proof search, logic programming, type checking. * Implementation: Abstract machines, parallel execution, optimal reduction, program optimization.
qPCF: A language for quantum circuit computations
PAOLINI, LUCA LUIGI;
2017-01-01
Abstract
The TLCA List of Open Problems (modeled after the RTA LOOP ) aims at collecting unresolved questions (and other relevant information, e.g. about solutions and related results) in the subject areas of the TLCA (Typed Lambda Calculi and Applications) series of conferences, in particular in the following topics: * Typed and untyped lambda-calculi as models of computation. * Proof-theory: Natural deduction, sequent calculi, cut elimination and normalization. Propositions as types, linear logic and proof nets. * Semantics: Denotational semantics, game semantics, realizability, categorical models. * Programming languages: Foundations of functional and object-oriented programming, proof search, logic programming, type checking. * Implementation: Abstract machines, parallel execution, optimal reduction, program optimization.File | Dimensione | Formato | |
---|---|---|---|
qPCF A Language for Quantum Circuit Computations - LNCS 2017 ori.pdf
Accesso riservato
Tipo di file:
PDF EDITORIALE
Dimensione
521.38 kB
Formato
Adobe PDF
|
521.38 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.