看哥吉拉-1.0 看到哭⋯。之前在義大利，以為是爽片，還和朋友們窩在沙發打鬧，結果越看越沈重，沒多久就先暫離了⋯。
今晚把剩下的部分看完，非常精彩，應該是我唯一會記得劇情的哥吉拉系列了（笑）
背景是二戰後頹敗的日本和遍體鱗傷的人民，很多人（心理）的戰爭尚未結束。不管是懷抱著沒盡力去做的遺憾，或喪失所愛之人的痛苦，每個人都有自己的故事、憤恨、和小小的堅持。
而面對哥吉拉，一個人類與之相比如此微渺的存在，當他踏入東京、摧毀銀座，生死存亡間的人們，在國際政治角力的無力下，只能依靠自己——是的，這是部重寫國家、天皇為上的歷史之作，把痛苦和勇氣的視角重新回歸到人民身上——拼搏不是為了國家榮譽而玉碎的特攻，而是為了和所愛之人再度重逢的生存之戰。
都說戰爭中，受苦最深的往往是人民。當然，電影通常是幻想的敘事，實際上面對國家的威權和體制，老百姓能做的、能反抗的如此之少；然而，即便作為一種愛的想望和替代，以及對傷口的溫柔撫觸，我想這部電影已然足夠。
The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems. Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs. Following this line of research, we define here a general framework for the bottom-up evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.
The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems. Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs. Following this line of research, we define here a general framework for the bottom-up evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.
The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems. Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs. Following this line of research, we define here a general framework for the bottom-up evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.
Muuu 🏳️🌈⛰️
nope