论文信息 - Categorical models of logical systems in the mathematical theory of programming

Categorical models of logical systems in the mathematical theory of programming

In our paper we follow the results of modelling logical systems over type theory using fibrations. We construct linear type theory and propositional linear logical system over it as a fibration on syntactic level and then we construct its model as a morphism of fibrations. We formulate the theorem of soundness and sketch its proof.

Valerie Novitzká | Daniel Mihályi | Viliam Slodi

[1] Jean-Yves Girard,et al. Linear logic: its syntax and semantics , 1995 .

[2] Simon Ambler. First order linear logic in symmetric monoidal closed categories , 1991 .

[3] Paul Curzon,et al. On Intuitionistic Linear Logic , 2005 .

[4] Michael Barr,et al. Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[5] Valerie Novitzká. LOGICAL REASONING ABOUT PROGRAMMING OF MATHEMATICAL MACHINES , 2005 .

[6] Bart Jacobs,et al. Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.

[7] Valerie Novitzká,et al. CHURCH'S TYPES IN LOGICAL REASONING ON PROGRAMMING , 2006 .