Results 11 to 20 of about 1,543,905 (277)
Fave: Sección Ciencias Agrarias, 2021 La flora nativa posee un enorme potencial paisajístico que ha sido poco explorado. En el presente trabajo se han estudiado aspectos relacionados con las semillas y comportamiento germinativo de tres especies vegetales nativas del centro - norte ...
N. GHÍO +5 more
doaj +1 more source
Extending the theory of Owicki and Gries with a logic of progress [PDF]
Logical Methods in Computer Science, 2006 This paper describes a logic of progress for concurrent programs. The logic is based on that of UNITY, molded to fit a sequential programming model. Integration of the two is achieved by using auxiliary variables in a systematic way that incorporates ...
Brijesh Dongol, Doug Goldson
doaj +1 more source
Constraint solving in non-permutative nominal abstract syntax [PDF]
Logical Methods in Computer Science, 2011 Nominal abstract syntax is a popular first-order technique for encoding, and reasoning about, abstract syntax involving binders. Many of its applications involve constraint solving.
Matthew R. Lakin
doaj +1 more source
A Rewriting View of Simple Typing [PDF]
Logical Methods in Computer Science, 2013 This paper shows how a recently developed view of typing as small-step abstract reduction, due to Kuan, MacQueen, and Findler, can be used to recast the development of simple type theory from a rewriting perspective.
Aaron Stump +3 more
doaj +1 more source
Lazy Evaluation and Delimited Control [PDF]
Logical Methods in Computer Science, 2010 The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics.
Ronald Garcia +2 more
doaj +1 more source
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Logical Methods in Computer Science, 2022 Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
Datatype defining rewrite systems for naturals and integers [PDF]
Logical Methods in Computer Science, 2021 A datatype defining rewrite system (DDRS) is an algebraic (equational) specification intended to specify a datatype. When interpreting the equations from left-to-right, a DDRS defines a term rewriting system that must be ground-complete.
Jan A. Bergstra, Alban Ponse
doaj +1 more source
D.3.1 Pilot Implementation Plan
, 2023 Deliverable 3.1 introduces the implementation plans related to the energy vertical of the TARGET-X project. It describes trial sites, time plans, and test plans at different trial sites.
Khan, Benish, Pitz, Manuel
openaire +1 more source
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +1 more source
Call-by-value Termination in the Untyped lambda-calculus [PDF]
Logical Methods in Computer Science, 2008 A fully-automated algorithm is developed able to show that evaluation of a given untyped lambda-expression will terminate under CBV (call-by-value).
Neil D. Jones, Nina Bohr
doaj +1 more source