On the denotational semantics of Linear Logic with least and greatest fixed points of formulas.
Thomas EhrhardFarzad Jafar-RahmaniPublished in: CoRR (2019)
Keyphrases
- linear logic
- denotational semantics
- fixed point
- programming language
- logic programming
- operational semantics
- cut elimination
- sequent calculus
- query language
- desirable properties
- general purpose
- sufficient conditions
- database
- inference rules
- abstract data types
- temporal difference learning
- approximate value iteration
- belief propagation
- logical framework
- natural deduction
- message passing
- markov random field
- upper bound
- np hard
- high level
- databases