Constructing Infinitary Quotient-Inductive Types

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of inductive-inductive definitions involving strictly positive occurrences of Hofmann-style quotient types, and Abel's size types. The latter, which provide a convenient constructive abstraction of what classically would be accomplished with transfinite ordinals, are used to prove termination of the recursive definitions of the elimination and computation properties of our encoding of QW-types. The development is formalized using the Agda theorem prover

Constructing Infinitary Quotient-Inductive Types

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of inductive-inductive definitions involving strictly positive occurrences of Hofmann-style quotient types, and Abel's size types. The latter, which provide a convenient constructive abstraction of what classically would be accomplished with transfinite ordinals, are used to prove termination of the recursive definitions of the elimination and computation properties of our encoding of QW-types. The development is formalized using the Agda theorem prover.Comment: The accompanying Agda code can be found at https://doi.org/10.17863/CAM.4818

The contemporary visualization and modelling technologies and the techniques for the design of the green roofs

The contemporary design solutions are merging the boundaries between real and virtual world. The Landscape architecture like the other interdisciplinary field stepped in a contemporary technologies area focused on that, beside the good execution of works, designer solutions has to be more realistic and “touchable”. The opportunities provided by Virtual Reality are certainly not negligible, it is common knowledge that the designs in the world are already presented in this way so the Virtual Reality increasingly used. Following the example of the application of virtual reality in landscape architecture, this paper deals with proposals for the use of virtual reality in landscape architecture so that designers, clients and users would have a virtual sense of scope e.g. rooftop garden, urban areas, parks, roads, etc. It is a programming language that creates a series of images creating a whole, so certain parts can be controlled or even modified in VR. Virtual reality today requires a specific gadget, such as Occulus, HTC Vive, Samsung Gear VR and similar. The aim of this paper is to acquire new theoretical and practical knowledge in the interdisciplinary field of virtual reality, the ability to display using virtual reality methods, and to present through a brief overview the plant species used in the design and construction of an intensive roof garden in a Mediterranean climate, the basic characteristics of roofing gardens as well as the benefits they carry. Virtual and augmented reality as technology is a very powerful tool for landscape architects, when modeling roof gardens, parks, and urban areas. One of the most popular technologies used by landscape architects is Google Tilt Brush, which enables fast modeling. The Google Tilt Brush VR app allows modeling in three-dimensional virtual space using a palette to work with the use of a three dimensional brush. The terms of two "programmed" realities - virtual reality and augmented reality - are often confused. One thing they have in common, though, is VRML - Virtual Reality Modeling Language. In this paper are shown the ways on which this issue can be solved and by the way, get closer the term of Virtual Reality (VR), also all the opportunities which the Virtual reality offered us. As well, in this paper are shown the conditions of Mediterranean climate, the conceptual solution and the plant species which will be used by execution of intensive green roof on the motel “Marković”

The benefits of an additional practice in descriptive geomerty course: non obligatory workshop at the Faculty of Civil Engineering in Belgrade

At the Faculty of Civil Engineering in Belgrade, in the Descriptive geometry (DG) course, non-obligatory workshops named “facultative task” are held for the three generations of freshman students with the aim to give students the opportunity to get higher final grade on the exam. The content of this workshop was a creative task, performed by a group of three students, offering free choice of a topic, i.e. the geometric structure associated with some real or imagery architectural/art-work object. After the workshops a questionnaire (composed by the professors at the course) is given to the students, in order to get their response on teaching/learning materials for the DG course and the workshop. During the workshop students performed one of the common tests for testing spatial abilities, named “paper folding". Based on the results of the questionnairethe investigation of the linkages between:students’ final achievements and spatial abilities, as well as students’ expectations of their performance on the exam, and how the students’ capacity to correctly estimate their grades were associated with expected and final grades, is provided. The goal was to give an evidence that a creative work, performed by a small group of students and self-assessment of their performances are a good way of helping students to maintain motivation and to accomplish their achievement. The final conclusion is addressed to the benefits of additional workshops employment in the course, which confirmhigherfinal scores-grades, achievement of creative results (facultative tasks) and confirmation of DG knowledge adaption

On Complexity Bounds and Confluence of Parallel Term Rewriting

We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques to derive both upper and lower bounds on parallel complexity of rewriting that enable a direct reuse of existing techniques for sequential complexity. Our approach to find lower bounds requires confluence of the parallel-innermost rewrite relation, thus we also provide effective sufficient criteria for proving confluence. The applicability and the precision of the method are demonstrated by the relatively light effort in extending the program analysis tool AProVE and by experiments on numerous benchmarks from the literature.Comment: Under submission to Fundamenta Informaticae. arXiv admin note: substantial text overlap with arXiv:2208.0100

Klonovi nedeterminističkih operacija

This thesis is a survey of some well-known and several new results concerning lattices of total, partial, incompletely specified clones and hyper-clones. We assign to every partial, incompletely specified and hyperoperation a suitable total operation and investigate thereby induced embeddings of the three lattices into corresponding lattices of total clones. Next we modify the famous Galois connection (Pol,Inv) between relations and operations for partial operations, IS operations and hyperoperations and describe classes of clones of IS operations and hyperoperations which strongly and weakly preserve given relations. We also state some known results concerning the four lattices on a two-element set. Finally, we present completeness criteria for the lattices of total and partial clones, and in the case of hyperclones and IS clones we describe four classes of coatoms, determined by four classes of Rosenberg’s relations.Ова теза представља преглед неких познатих и неколико нових резултата везаних за мреже тоталних, парцијалних, непотпуно специфицираних клонова и хиперклонова. Свакој парцијалној, непотпуно специфицираној и хипероперацији придружијемо одговарајућу тоталну операцију, и испитујемо тиме индукована потапања три мреже у одговарајуће мреже тоталних клонова. Потом познату Галоаову везу (Pol,Inv) између релација и операција модификујемо за парцијалне операције, НС опера-ције и хипероперације и описујемо класе клонова непотпуно специфици-раних и хипероперација које јако и слабо чувају дате релације. Такође наводимо неке познате резултате о мрежама на двоелементном скупу. Коначно, наводимо критеријуме комплетности за мреже тоталних и парцијалних клонова, а у случају хиперклонова и НС клонова описујемо четири класе коатома, одређених са четири класе Розенбергових релација.Ova teza predstavlja pregled nekih poznatih i nekoliko novih rezultata vezanih za mreže totalnih, parcijalnih, nepotpuno specificiranih klonova i hiperklonova. Svakoj parcijalnoj, nepotpuno specificiranoj i hiperoperaciji pridružijemo odgovarajuću totalnu operaciju, i ispitujemo time indukovana potapanja tri mreže u odgovarajuće mreže totalnih klonova. Potom poznatu Galoaovu vezu (Pol,Inv) između relacija i operacija modifikujemo za parcijalne operacije, NS opera-cije i hiperoperacije i opisujemo klase klonova nepotpuno specifici-ranih i hiperoperacija koje jako i slabo čuvaju date relacije. Takođe navodimo neke poznate rezultate o mrežama na dvoelementnom skupu. Konačno, navodimo kriterijume kompletnosti za mreže totalnih i parcijalnih klonova, a u slučaju hiperklonova i NS klonova opisujemo četiri klase koatoma, određenih sa četiri klase Rozenbergovih relacija

Decidability of Conversion for Type Theory in Type Theory

Type theory should be able to handle its own meta-theory, both to justify its foundational claims and to obtain a verified implementation. At the core of a type checker for intensional type theory lies an algorithm to check equality of types, or in other words, to check whether two types are convertible. We have formalized in Agda a practical conversion checking algorithm for a dependent type theory with one universe \ue0 la Russell, natural numbers, and η-equality for Π types. We prove the algorithm correct via a Kripke logical relation parameterized by a suitable notion of equivalence of terms. We then instantiate the parameterized fundamental lemma twice: once to obtain canonicity and injectivity of type formers, and once again to prove the completeness of the algorithm. Our proof relies on inductive-recursive definitions, but not on the uniqueness of identity proofs. Thus, it is valid in variants of intensional Martin-L\uf6f Type Theory as long as they support induction-recursion, for instance, Extensional, Observational, or Homotopy Type Theory

Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes

We address the problem of analysing the complexity of concurrent programs written in Pi-calculus. We are interested in parallel complexity, or span, understood as the execution time in a model with maximal parallelism. A type system for parallel complexity has been recently proposed by the first two authors but it is too imprecise for non-linear channels and cannot analyse some concurrent processes. Aiming for a more precise analysis, we design a type system which builds on the concepts of sized types and usages. The sized types allow us to parametrize the complexity by the size of inputs, and the usages allow us to achieve a kind of rely-guarantee reasoning on the timing each process communicates with its environment. We prove that our new type system soundly estimates the parallel complexity, and show through examples that it is often more precise than the previous type system of the first two authors

Multi-Agent Modeling for Integrated Process Planning and Scheduling

Multi-agent systems have been used for modelling various problems in the social, biological and technical domain. When comes to technical systems, especially manufacturing systems, agents are most often applied in optimization and scheduling problems. Traditionally, scheduling is done after creation of process plans. In this paper, agent methodology is used for integration of these two functions. The proposed multi-agent architecture provides simultaneous performance of process planning and scheduling and it consists of four intelligent agents: part and job agents, machine agent, and optimization agent. Verification and feasibility of a proposed approach is conducted using agent based simulation in AnyLogic software

Multi-Agent Modeling for Integrated Process Planning and Scheduling

Multi-agent systems have been used for modelling various problems in the social, biological and technical domain. When comes to technical systems, especially manufacturing systems, agents are most often applied in optimization and scheduling problems. Traditionally, scheduling is done after creation of process plans. In this paper, agent methodology is used for integration of these two functions. The proposed multi-agent architecture provides simultaneous performance of process planning and scheduling and it consists of four intelligent agents: part and job agents, machine agent, and optimization agent. Verification and feasibility of a proposed approach is conducted using agent based simulation in AnyLogic software