Learn More
In this paper we present a call-by-value PCF that is a variant of typed lambda calculus with a decidable first order logic. The main motivation of this new call-by-value language is to verify the correctness and reliability of using decidable conditionals in the design of practical call-by-value functional languages. And another application of this new(More)
Parameterization extends higher-order processes with the capability of abstraction (akin to that in lambda-calculus), and is known to be able to enhance the expressiveness. This paper focuses on the parameterization of names, i.e. a construct that maps a name to a process, in the higher-order setting. We provide two results concerning its computation(More)
A regio- and diastereoselective cross-dehydrogenative coupling of N-carbamoyl tetrahydropyridines with a variety of 1,3-dicarbonyl compounds is described. The method exhibits good functional group tolerance, diastereoselectively generating cis-2,6- or cis-2,4-substituted tetrahydropyridines by using different types of 1,3-dicarbonyls. Moreover, a two-step(More)
The π calculus and the safe ambient calculus are two of the widely studied variants of process calculi in the field of concurrency theory. The former is the most classic model for mobile processes and the latter is well known for its nested structure. However, the relationship between these two models deserves further investigation. In this paper, we(More)
Concurrency semantics plays an important role in both concurrency theory and software engineering. Although many results on various concurrency semantics have been proposed, there is still room for improvement. This paper focuses on the locality semantics, an important non-interleaving semantics, based on studying the relationship between the located CCS(More)