Multiple-Conclusion System as Communication Calculus : Informal meaning of proofs as communication terms (Algebraic Systems, Formal Languages and Computations)
スポンサーリンク
概要
著者
関連論文
-
λμ計算のモデルについて
-
A Galois embedding from polymorphic types into existential types : Extended Abstract (Proof Theory and Computation Theory)
-
構成的プログラミング
-
2階直観主義命題論理のKripkeモデルと束論的モデルの双対性 (形式体系と計算理論)
-
An Injective CPS-translation for the Extensional λ-calculus
-
安全な動的型と分散プロクラミング
-
部分型推論の困難さに関する一考察
-
Domain-Free $\lambda\mu$-Calculus for Polymorphism and Call-by-Value (Languages, Algebra and Computer Systems)
-
μ-Head Form Proofs with at Most Two Formulas in the Succedent
-
μ冠頭形証明とそのプログラミングへの応用に関する一考察
-
Martin-Lofの型理論に基づくプログラム支援システムの構築
-
類推における証明項の変換について
-
Bengt Nordstrom, Kent Petersson and Jan M. Smith : Programming in Martin-Lof's Type Theory, An Introduction, Clarendon Press (1990). ISBN 0-19-853814-6
-
CPS-translation as adjoint: extended abstract (算術体系の証明論--RIMS共同研究報告集)
-
Parallel Computation and Synchronized Term Rewriting Systems : Extended Abstract (Algebraic Semigroups, Formal Languages and Computation)
-
Residuated mapping and CPS-translation : Extended abstract(Algebras, Languages, Computations and their Applications)
-
Galois embedding from universal types into existential types : Extended Abstract(Algorithmic problems in algebra, languages and computation systems)
-
A sound and complete CPS-translation for $\lambda\mu$-calculus : Extended abstract (Algebra, Languages and Computation)
-
$\gamma$-Calculus with Lazy Lists : Extended abstract (Algorithms in Algebraic Systems and Computation Theory)
-
Multiple-Conclusion System as Communication Calculus : Informal meaning of proofs as communication terms (Algebraic Systems, Formal Languages and Computations)
-
Strong Normalization of Pure $\mathit{GL}_w$-$\lambda\mu$-Terms
-
Calculus of Classical Proofs from Programming Viewpoint(New Aspects in Non-Classical Logics and Their Kripke Semantics)
もっと見る
閉じる
スポンサーリンク