Wyniki wyszukiwania - BazTech

1

Konstytutywne cechy BIM – parametryczność, interoperacyjność, wielowymiarowość

Borkowski Andrzej Szymon

Builder

|

2024

|

R.28, nr 1

12--17

PL

Proces inwestycyjno-budowlany w Polsce przechodzi głęboką cyfryzację. W wielu fazach i na różnych etapach tego procesu wykorzystuje się BIM. W teorii i praktyce podkreśla się, że BIM to nie CAD 3D, że BIM odróżnia bogactwo danych niegeometrycznych, że BIM daje przewagę konkurencyjną. Po blisko dwóch dekadach rozwoju BIM rodzą się pytania: Co jest głównymi składnikami BIM? Co go wyraźnie odróżnia od CAD? Co sprawiło, że wyodrębnił się z CAD? W artykule podjęto próbę odpowiedzi na te pytania w toku głębokiego studium literatury. Na podstawie najnowszych badań oraz najnowszego stanu techniki ustalono trzy konstytutywne cechy BIM – parametryczność, interoperacyjność i wielowymiarowość. Znajomość ich ważności i dogłębne zrozumienie może prowadzić do poprawy efektywności i produktywności branży AECOO.

EN

The investment and construction process in Poland is undergoing profound digitization. BIM is being used in many phases and at various stages of this process. In theory and practice, one highlights that BIM is not 3D CAD, that BIM is distinguished by a wealth of non-geometric data, that BIM gives a competitive advantage. After nearly two decades of BIM development, the questions arise: What are the main components of BIM? What clearly distinguishes it from CAD? What made it separate from CAD? The article attempts to answer these questions adequately through a deep study of the literature. Based on the latest research and state of the art, three constitutive features of BIM – parametricity, interoperability and multidimensionality – have been established. Knowledge of their relevancy and in-depth understanding can lead to improved efficiency and productivity of the AECOO industry.

2

The Impact of seq on Free Theorems-Based Program Transformations

Johann P., Voigtländer J.

Fundamenta Informaticae

|

2006

|

Vol. 69, nr 1,2

63-102

EN

Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. Unfortunately, standard parametricity results - including so-called free theorems - fail for nonstrict languages supporting a polymorphic strict evaluation primitive such as Haskell's seq. A folk theorem maintains that such results hold for a subset of Haskell corresponding to a Girard-Reynolds calculus with fixpoints and algebraic datatypes even when seq is present provided the relations which appear in their derivations are required to be bottom-reflecting and admissible. In this paper we show that this folklore is incorrect, but that parametricity results can be recovered in the presence of seq by restricting attention to left-closed, total, and admissible relations instead. The key novelty of our approach is the asymmetry introduced by left-closedness, which leads to ``inequational'' versions of standard parametricity results together with preconditions guaranteeing their validity even when seq is present. We use these results to derive criteria ensuring that both equational and inequational versions of short cut fusion and related program transformations based on free theorems hold in the presence of seq.

3

An axiomatic system of parametricity

Takeuti I.

Fundamenta Informaticae

|

1998

|

Vol. 33, nr 4

397-432

EN

Plotkin and Abadi have proposed a syntactic system for parametricity based on a second order predicate logic. This paper shows three theorems about that system. The first is consistency of the system, which is proved by the method of relativization. The second is that polyadic parametricities of recursive types are equivalent to each other. The third is that the theory of parametricity for recursive types is self-realizable. As a corollary of the third theorem, the theory of parametricity for recursive types satisfies the term extraction property.