格言 发表于 2025-4-1 05:00:27

Inductive Type Schemas as Functorss between parameters one can construct a function between the instantiated inductive types representing the change of parameters along these functions. It is well known that it is not a functor w.r.t. intensional equality based on standard reductions. We investigate a simple type system with inducti

SLUMP 发表于 2025-4-1 09:05:18

Unfolding Synthesis of Asynchronous Automataributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our approach is based on an unfolding procedure that improves the complexity of Zielonka’s and Pigh
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Computer Science -- Theory and Applications; First International Dima Grigoriev,John Harrison,Edward A. Hirsch Conference proceedings 2006