Channel

PLComp

@plcomp

On this record: Growth · Engagement · What this channel posts · Reactions · Posts · Citations · Cite this entry

828subscribers

+0 since we began measuring on 6 August 2026

Risers and fallers across the register · movement among entries of Under 1,000.

Register entry

Telegram ID	-1001398668646
Type	Channel
Username	@plcomp
Description	Языки и компиляторы: вопросы реализации от входного синтаксиса до порождения машинного кода. Авторы: @vekazanov @igorjirkov @true_grue @clayrat @eupp7 @alexanius @AntonTrunov @GabrielFallen @ligurio
Created	Between 1 December 2018 and 30 June 2021— estimated from Telegram’s id allocation, not measured. How this range is calculated.
First recorded	6 August 2026
Last confirmed live	7 August 2026
Measurements held	2
On Telegram	t.me/plcomp

Growth

2 measurements taken within a single day. Dots are measurements; the straight line between them is drawn to join them, not to claim we know the path taken in between — snapshots are recorded only when a count changes, so gaps mean “no change observed”, never “interpolated”. The vertical axis spans 827–829 and does not start at zero.

Measurement log — every subscribers count we have recorded
Measured (UTC)	Subscribers	Change
6 Aug 2026, 22:45	828	no change
6 Aug 2026, 22:37	828	first reading

Engagement

20 posts held, back to 28 March 2024 — the reader has not yet reached the start of this channel’s public history, so older posts may sit further back, unread. Read across 1 pageof Telegram’s post history, 20 posts per page.

Nothing published in the last 30 days. ERR and ER are rolling 30-day measures, so there is nothing to compute — we hold 20 posts for this entry, the most recent from 10 October 2025. An engagement rate over an empty window would be a number about nothing.

What this channel posts

Links: 102

Lifetime counters from Telegram’s own channel header, read 6 August 2026 — not the date at the top of this page, which is when the subscriber count was last read. Below Telegram’s rounding threshold, so these counts are exact.

Reaction mix

461 reactions across 20 posts, in 1 kind.

Every reaction kind recorded on the sample, most used first
Reaction	Count	Share	Share, drawn
👍	461	100.0%

No sentiment is inferred, and none should be read in. This table is ordered by count and by nothing else. Emoji do not carry stable meaning across languages or communities — 🙏 is thanks in one channel and mourning in another — so we publish which ones were pressed and how often, and pass no judgement on what an audience meant by them.

Precision. Telegram publishes reaction counts per emoji and short-forms each one — 4.34K, 1.2M — so any single kind at or above 1,000 reaches us at three significant figures, and only counts below 1,000 are exact. The shares above are ratios of those figures and carry the same error. This is also why the total here can differ slightly from a reaction total printed elsewhere on the page: both are sums of the same rounded parts, taken over samples with different edges.

Coverage. Reactions were read on 20 of the 20 sampled posts in this sample. Summed by Telegram’s own count on each post — not by adding up the per-emoji breakdown above — those same posts carry 461reactions in total: the kind of figure the paragraph above means by “a reaction total printed elsewhere on the page”.

Measured over the 20 most recent posts we hold, published 28 March 2024 to 10 October 2025, using the newest reading held for each. Telegram Stars are excluded: they are a payment, not a reaction, and they have their own section.

Recent posts

10 Oct 2025, 09:48 UTC≈1,920 views34 reactionsread 6 August 2026

В наше время может сложиться впечатление, что компиляторы вне LLVM уже не создаются. Это, конечно, не так и я хочу привести в пример два небольших компилятора, над которыми я работал в последнее время. 1. Компилятор HOREC из статьи HOREC: компилятор специализированных регулярных выражений для проектирования программируемой и ресурсоэффективной аппаратной архитектуры. 2. DSL-компилятор для проекта учебной игровой при…

👍34

Signed Peter Sovietov

16 Jun 2025, 16:59 UTC≈1,870 views34 reactionsread 6 August 2026

Forwarded from @sysconf_channel

#видеозаписи Начинаем публиковать видео докладов sysconf 2025. Первым — выступление Петра Советова «Генератор случайных процессорных архитектур для обучения системному программированию» YouTube | VK Видео Скачать презентацию с сайта sysconf

👍34

Signed Peter Sovietov

21 May 2025, 10:47 UTC≈2,790 views32 reactionsread 6 August 2026

File

Недавно удалось лично пообщаться с несколькими известными преподавателями разработки компиляторов. Евгений Зуев. Я был экспертом на его докладе. За семестр студентам необходимо разработать реализацию одного из возможных проектных языков. Преподаватель объясняет основы, используя мастер-язык. Идея мастер-языка мне показалась перспективной. Иван Кулагин и Дмитрий Мельник. В рамках круглого стола они подготовили детал…

👍32

Signed Peter Sovietov

26 Nov 2024, 13:09 UTC≈3,170 views29 reactionsread 6 August 2026

В ближайшее время в Москве пройдет три конференции, связанные с системным программированием, а, значит, и с компиляторами. 1. 11-12 декабря. Открытая конференция ИСП РАН. Часть программы уже опубликована. Для преподавателей отдельный интерес представляет круглый стол по проблемам образования в области системного программирования. Для компиляторщиков -- секция «Технологии анализа, моделирования и трансформации програ…

👍29

Signed Peter Sovietov

29 Sept 2024, 18:20 UTC≈3,490 views56 reactionsread 6 August 2026

Я и мой студент, Кирилл Павлов, опубликовали статью "Библиотека llvm2py для анализа промежуточного представления LLVM и её применение в оценке степени распараллеливания линейных участков кода". Чем может быть интересна работа студента второго курса бакалавриата? Анализ распараллеливания делается для варианта LLVM IR, где линейные участки заданы ярусно-параллельной формой (ЯПФ). Автоматическое построение ЯПФ позволяе…

👍56

Signed Peter Sovietov

23 Jul 2024, 12:18 UTC≈2,060 views12 reactionsread 6 August 2026

Forwarded from @covalue

Первый интерпретатор просто использует эти функции напрямую для рекурсивного аннотирования программы, не пытаясь вывести инварианты циклов (подставляя вместо них тривиально истинные формулы). Его корректность сводится к трем свойствам: (1) наислабейшее предусловие, полученное из вычисленного конечного состояния, действительно слабее предусловия, полученного из начального состояния, (2) все условия проверки, полученны…

👍12

Signed Alex Gryzlov

23 Jul 2024, 12:18 UTC≈1,390 views12 reactionsread 6 August 2026

Forwarded from @covalue

Bertot, [2008] "Structural abstract interpretation, A formal study using Coq" + порт на Агду В статье обсуждается кодирование внутри теории типов подхода к статическому анализу программ, известного как абстрактная интерпретация (АИ). Для анализа взят простой императивный язык с целочисленными значениями (можно ограничить до натуральных) со сложением и булевым сравнением, мутабельными переменными, последовательной к…

👍12

Signed Alex Gryzlov

17 May 2024, 06:38 UTC≈2,970 views13 reactionsread 6 August 2026

Video

Программа с использованием сборщика мусора с алгоритмом Mark and Sweep.

👍13

Signed Sergey Bronnikov

17 May 2024, 06:37 UTC≈2,680 views4 reactionsread 6 August 2026

Video

Программа со счётчиком ссылок.

👍4

Signed Sergey Bronnikov

17 May 2024, 06:36 UTC≈2,500 views5 reactionsread 6 August 2026

Video

Программа без освобождения памяти (NO_GC).

👍5

Signed Sergey Bronnikov

17 May 2024, 06:36 UTC≈3,210 views29 reactionsread 6 August 2026

Возможно вы знакомы с алгоритмами сборки мусора, которые используются в языках программирования. Американский программист Кен Фокс (Ken Fox) написал программу с использованием разных алгоритмов сборки мусора и вариант программы без освобождения памяти, собрал данные для каждого варианта запуска программы и сгенерировал анимированные изображения для них. В репозитории представлены визуализации четырех основных алгорит…

👍29

Signed Sergey Bronnikov

29 Apr 2024, 04:57 UTC≈1,850 views20 reactionsread 6 August 2026

Implementation Strategies for Mutable Value Semantics Dimitri Racordon, Denys Shabalin, Daniel Zheng, Dave Abrahams, Brennan Saeta https://kyouko-taiga.github.io/assets/papers/jot2022-mvs.pdf Одно из неоспоримых достоинств языка Rust — он наглядно показал, что безопасная работа с указателями и ссылками сложна, и требует следовать довольно замысловатым правилам, уберегающим от неочевидных потенциальных проблем. Даже …

👍20

Signed Alexander Chichigin

Showing the 12 most recent of 20 posts we hold for @plcomp. View and reaction counts are the latest single reading for each post, not a live figure, and a recent post is still accumulating both. A view count marked ≈ was rounded by Telegram before we ever saw it — t.me prints views in full below 1,000 and to three significant figures above, so ≈1,200,000 means somewhere between 1,150,000 and 1,249,999. Unmarked counts are exact. Text is reproduced from the public post preview and truncated for length.

Citation-graph rank

Citation-graph rank — 1,155,086 of 1,160,990entries in the measured graph. A weighted position computed from the forward and mention edges below — republished posts weigh more than named mentions — and recomputed periodically, over the whole graph. Published only as this ordinal position, never as a score: a position is a fact, and a score printed beside one channel’s name would read as a verdict this register does not make. The two counts beneath stay separate for the same reason mentions are never summed with forwards anywhere else on this page — a named-by count costs nothing to manufacture. The top 100 by this measure, or how it is computed.

Forward network

Republishes

Channels on the register whose posts this channel has forwarded.

Covalue
@covalue · 8792 posts sysconf — канал конференции
@sysconf_channel · 2491 post

Built only from forwarded posts we have actually read, on both sides. Coverage is early and deliberately incomplete: a missing link means we have not read the post that would prove it, never that the relationship does not exist. Counts are distinct forwarded posts observed, so they only ever go up as we read more.

Mentions

Named by 1 registered channel — every channel on the register whose own posts have named this one, by its current username or any other username it currently holds, merged from two separately captured readings of the same fact so a namer caught by only one of them is not missed and a namer both caught is not counted twice. A username this channel has since dropped is not matched — that handle may belong to someone else now, and crediting today’s namer to yesterday’s owner would misattribute it.

Named by

Channels on the register whose posts name this channel's handle.

IT Channels 🌍
@itchannels · 2,0781 post

A mention is a weaker signal than a forward and is counted separately for that reason — naming a channel is not republishing it, and a handle in a post body is easy to place deliberately. The post counts beside each row below are distinct posts in which the handle appeared, from posts we have read on both sides — the “Named by N registered channels” figure above is a different count, of distinct NAMING CHANNELS rather than posts, and is not the sum of the rows under it.

Cite this entry

A live page changes as we take new readings, so a citation should name the measurement it is based on, not just the URL. The line below cites the subscriber count as measured 6 August 2026 — this entry's latest reading, not the date you are reading this.

“PLComp” (@plcomp), 828 subscribers as measured 6 August 2026. Telegram Register, tgregister.com/channel/plcomp.

Full measurement history, CC BY 4.0. Every reading this register holds for this entry, not just the latest one, as a dated, downloadable record: CSV · JSON. Free to use with attribution to tgregister.com. Each file carries its own generation timestamp, which is the figure to cite for exactly when the data was retrieved.